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/20170319-ConjunctivePathPrograms/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:21:56,987 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:21:56,989 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:21:57,002 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:21:57,003 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:21:57,005 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:21:57,006 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:21:57,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:21:57,012 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:21:57,021 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:21:57,022 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:21:57,022 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:21:57,023 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:21:57,024 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:21:57,029 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:21:57,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:21:57,034 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:21:57,037 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:21:57,042 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:21:57,043 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:21:57,045 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:21:57,046 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:21:57,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:21:57,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:21:57,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:21:57,051 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:21:57,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:21:57,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:21:57,056 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:21:57,057 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:21:57,057 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:21:57,059 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:21:57,059 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:21:57,059 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:21:57,061 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:21:57,062 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:21:57,062 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 [2018-12-03 15:21:57,085 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:21:57,085 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:21:57,086 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:21:57,086 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:21:57,087 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:21:57,088 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:21:57,088 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:21:57,088 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:21:57,088 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:21:57,088 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:21:57,089 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:21:57,089 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:21:57,089 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:21:57,089 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:21:57,089 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:21:57,091 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:21:57,091 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:21:57,092 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:21:57,092 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:21:57,092 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:21:57,092 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:21:57,092 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:21:57,094 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:21:57,094 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:21:57,095 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:21:57,095 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:21:57,095 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:21:57,095 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:21:57,095 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:21:57,096 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:21:57,096 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:21:57,096 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:21:57,096 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:21:57,096 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:21:57,097 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:21:57,097 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:21:57,097 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:21:57,097 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:21:57,097 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:21:57,098 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:21:57,098 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:21:57,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:21:57,171 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:21:57,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:21:57,177 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:21:57,178 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:21:57,179 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-12-03 15:21:57,179 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl' [2018-12-03 15:21:57,227 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:21:57,229 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:21:57,230 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:57,230 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:21:57,230 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:21:57,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:57" (1/1) ... [2018-12-03 15:21:57,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:57" (1/1) ... [2018-12-03 15:21:57,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:57,269 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:21:57,269 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:21:57,269 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:21:57,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:57" (1/1) ... [2018-12-03 15:21:57,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:57" (1/1) ... [2018-12-03 15:21:57,282 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:57" (1/1) ... [2018-12-03 15:21:57,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:57" (1/1) ... [2018-12-03 15:21:57,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:57" (1/1) ... [2018-12-03 15:21:57,287 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:57" (1/1) ... [2018-12-03 15:21:57,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:57" (1/1) ... [2018-12-03 15:21:57,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:21:57,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:21:57,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:21:57,291 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:21:57,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:21:57,361 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:21:57,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:21:57,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:21:57,518 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:21:57,518 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:21:57,519 INFO L202 PluginConnector]: Adding new model overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:57 BoogieIcfgContainer [2018-12-03 15:21:57,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:21:57,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:21:57,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:21:57,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:21:57,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:57" (1/2) ... [2018-12-03 15:21:57,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5928dbcd and model type overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:21:57, skipping insertion in model container [2018-12-03 15:21:57,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:57" (2/2) ... [2018-12-03 15:21:57,527 INFO L112 eAbstractionObserver]: Analyzing ICFG overflow1.i_3.bplTransformedIcfg_BEv2_4.bpl [2018-12-03 15:21:57,537 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:21:57,545 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:21:57,564 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:21:57,600 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:21:57,600 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:21:57,600 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:21:57,600 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:21:57,601 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:21:57,601 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:21:57,601 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:21:57,601 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:21:57,618 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:21:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:21:57,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:57,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:21:57,629 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:57,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:57,635 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2018-12-03 15:21:57,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:57,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:57,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:57,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:21:57,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:21:57,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:57,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:21:57,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:21:57,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:21:57,820 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:21:57,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:57,878 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 15:21:57,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:21:57,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:21:57,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:57,892 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:21:57,893 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:21:57,897 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:21:57,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:21:57,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:21:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:21:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:21:57,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:21:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:57,935 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:21:57,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:21:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:21:57,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:21:57,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:57,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:21:57,936 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:57,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:57,937 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2018-12-03 15:21:57,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:57,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:57,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:57,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:58,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:58,038 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:21:58,040 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 15:21:58,125 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:21:58,126 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:21:58,574 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:21:58,576 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 9 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:21:58,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:58,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:21:58,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:58,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:58,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:58,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:58,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:58,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:58,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:58,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:21:58,813 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:58,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:21:58,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:21:58,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:58,814 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 15:21:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:58,858 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 15:21:58,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:21:58,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 15:21:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:58,859 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:21:58,859 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:21:58,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:21:58,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:21:58,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:21:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:21:58,862 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 15:21:58,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:58,862 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:21:58,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:21:58,863 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:21:58,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:21:58,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:58,864 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:21:58,864 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:58,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:58,865 INFO L82 PathProgramCache]: Analyzing trace with hash 28783137, now seen corresponding path program 2 times [2018-12-03 15:21:58,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:58,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:58,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:58,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:58,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:58,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:58,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:58,962 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:58,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:58,975 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:58,975 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:58,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:21:58,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:58,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:59,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:21:59,140 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:59,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:21:59,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:21:59,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:21:59,142 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 15:21:59,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:59,207 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:21:59,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:21:59,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 15:21:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:59,209 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:21:59,209 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:21:59,210 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 [2018-12-03 15:21:59,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:21:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:21:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:21:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:21:59,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 15:21:59,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:59,213 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:21:59,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:21:59,213 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:21:59,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:21:59,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:59,214 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:21:59,214 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:59,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:59,215 INFO L82 PathProgramCache]: Analyzing trace with hash 892275272, now seen corresponding path program 3 times [2018-12-03 15:21:59,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:59,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:59,216 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:59,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:59,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:59,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,318 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:59,318 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:59,318 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:59,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:59,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:59,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:59,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:59,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:59,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:59,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:59,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:59,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:21:59,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:59,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:21:59,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:21:59,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:59,553 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 15:21:59,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:59,569 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 15:21:59,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:21:59,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:21:59,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:59,571 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:21:59,572 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:21:59,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:21:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:21:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:21:59,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:21:59,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 15:21:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:59,576 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:21:59,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:21:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:21:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:21:59,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:59,577 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 15:21:59,577 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:59,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1890727681, now seen corresponding path program 4 times [2018-12-03 15:21:59,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:59,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:59,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:59,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:59,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:59,841 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:59,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:59,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:59,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:59,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:59,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:59,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:00,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:00,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 15:22:00,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:00,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:22:00,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:22:00,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:22:00,083 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 15:22:00,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:00,115 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:22:00,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:22:00,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:22:00,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:00,116 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:22:00,116 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:22:00,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 15:22:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:22:00,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:22:00,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:22:00,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 15:22:00,120 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 15:22:00,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:00,120 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 15:22:00,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:22:00,121 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 15:22:00,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:22:00,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:00,121 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:22:00,122 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:00,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:00,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1516986008, now seen corresponding path program 5 times [2018-12-03 15:22:00,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:00,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:00,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:00,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:00,238 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:00,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:00,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:00,251 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:00,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:00,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:22:00,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:00,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:00,310 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:00,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:00,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:00,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 15:22:00,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:00,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:22:00,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:22:00,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:22:00,910 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 15:22:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:00,935 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 15:22:00,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:22:00,936 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:22:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:00,936 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:22:00,937 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:22:00,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:22:00,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:22:00,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:22:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:22:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:22:00,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 15:22:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:00,941 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:22:00,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:22:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:22:00,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:22:00,942 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:00,942 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:22:00,942 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:00,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:00,942 INFO L82 PathProgramCache]: Analyzing trace with hash 218072033, now seen corresponding path program 6 times [2018-12-03 15:22:00,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:00,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:00,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:01,143 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:01,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:01,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:01,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:01,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:01,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:01,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:01,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:01,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:01,163 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:01,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:01,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:01,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:01,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:01,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 15:22:01,327 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:01,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:22:01,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:22:01,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:22:01,328 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 15:22:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:01,362 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:22:01,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:22:01,363 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:22:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:01,363 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:22:01,363 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:22:01,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 15:22:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:22:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:22:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:22:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 15:22:01,367 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 15:22:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:01,367 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 15:22:01,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:22:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 15:22:01,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:22:01,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:01,368 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:22:01,368 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:01,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:01,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1829703544, now seen corresponding path program 7 times [2018-12-03 15:22:01,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:01,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:01,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:01,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:01,587 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:01,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:01,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:01,588 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:01,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:01,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:01,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:01,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:01,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:01,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:01,702 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:01,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:01,988 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:02,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:02,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 15:22:02,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:02,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:22:02,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:22:02,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:22:02,008 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 15:22:02,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:02,046 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 15:22:02,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:22:02,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:22:02,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:02,047 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:22:02,047 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:22:02,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:22:02,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:22:02,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:22:02,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:22:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:22:02,051 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 15:22:02,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:02,052 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:22:02,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:22:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:22:02,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:22:02,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:02,053 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 15:22:02,053 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:02,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:02,053 INFO L82 PathProgramCache]: Analyzing trace with hash -886236991, now seen corresponding path program 8 times [2018-12-03 15:22:02,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:02,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:02,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:02,415 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:02,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:02,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:02,416 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:02,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:02,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:02,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:02,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:02,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:02,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 15:22:02,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:02,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:02,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:02,681 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:02,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:02,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 15:22:02,702 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:02,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:22:02,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:22:02,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:22:02,703 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 15:22:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:02,727 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 15:22:02,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:22:02,729 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 15:22:02,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:02,729 INFO L225 Difference]: With dead ends: 15 [2018-12-03 15:22:02,729 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:22:02,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:22:02,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:22:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 15:22:02,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 15:22:02,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 15:22:02,733 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 15:22:02,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:02,733 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 15:22:02,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:22:02,734 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 15:22:02,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 15:22:02,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:02,734 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 15:22:02,734 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:02,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:02,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1703544920, now seen corresponding path program 9 times [2018-12-03 15:22:02,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:02,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:02,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:02,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:02,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:02,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:02,879 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:02,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:02,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:02,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:02,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:02,889 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:02,897 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:02,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:02,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:02,906 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:02,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:03,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:03,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 15:22:03,217 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:03,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 15:22:03,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 15:22:03,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:22:03,218 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 15:22:03,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:03,244 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 15:22:03,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:22:03,245 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 15:22:03,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:03,245 INFO L225 Difference]: With dead ends: 16 [2018-12-03 15:22:03,245 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 15:22:03,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:22:03,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 15:22:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 15:22:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:22:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 15:22:03,249 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 15:22:03,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:03,249 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 15:22:03,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 15:22:03,250 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 15:22:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:22:03,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:03,250 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 15:22:03,250 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:03,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:03,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1270286943, now seen corresponding path program 10 times [2018-12-03 15:22:03,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:03,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:03,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:03,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:03,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:03,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:03,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:03,401 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:03,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:03,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:03,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:03,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:03,411 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:03,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:03,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:03,679 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:03,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:03,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 15:22:03,701 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:03,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 15:22:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 15:22:03,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:22:03,703 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 15:22:03,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:03,725 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 15:22:03,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 15:22:03,725 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 15:22:03,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:03,726 INFO L225 Difference]: With dead ends: 17 [2018-12-03 15:22:03,726 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 15:22:03,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 15:22:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 15:22:03,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 15:22:03,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 15:22:03,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 15:22:03,730 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 15:22:03,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:03,731 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 15:22:03,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 15:22:03,731 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 15:22:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 15:22:03,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:03,731 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 15:22:03,731 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:03,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:03,732 INFO L82 PathProgramCache]: Analyzing trace with hash -724191544, now seen corresponding path program 11 times [2018-12-03 15:22:03,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:03,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:03,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:03,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:03,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:04,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:04,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:04,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:04,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:04,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:04,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:04,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:04,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:04,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 15:22:04,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:04,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:04,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:04,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:04,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 15:22:04,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:04,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:22:04,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:22:04,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:22:04,370 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 15:22:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:04,413 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 15:22:04,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 15:22:04,414 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 15:22:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:04,414 INFO L225 Difference]: With dead ends: 18 [2018-12-03 15:22:04,415 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 15:22:04,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:22:04,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 15:22:04,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 15:22:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 15:22:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 15:22:04,420 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 15:22:04,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:04,420 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 15:22:04,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:22:04,420 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 15:22:04,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:22:04,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:04,421 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 15:22:04,421 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:04,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:04,421 INFO L82 PathProgramCache]: Analyzing trace with hash -975103359, now seen corresponding path program 12 times [2018-12-03 15:22:04,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:04,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:04,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:04,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:04,423 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:04,598 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:04,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:04,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:04,599 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:04,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:04,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:04,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:04,610 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:04,610 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:04,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:04,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:04,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:04,646 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:04,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:05,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:05,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 15:22:05,273 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:05,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 15:22:05,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 15:22:05,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:22:05,275 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 15:22:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:05,305 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 15:22:05,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:22:05,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 15:22:05,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:05,307 INFO L225 Difference]: With dead ends: 19 [2018-12-03 15:22:05,307 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 15:22:05,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 15:22:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 15:22:05,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 15:22:05,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:22:05,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 15:22:05,313 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 15:22:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:05,313 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 15:22:05,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 15:22:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 15:22:05,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:22:05,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:05,314 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 15:22:05,314 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:05,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:05,314 INFO L82 PathProgramCache]: Analyzing trace with hash -163435032, now seen corresponding path program 13 times [2018-12-03 15:22:05,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:05,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:05,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:05,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,731 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:05,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:05,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:05,732 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:05,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:05,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:05,733 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:05,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:05,743 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:05,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:05,765 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:05,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:06,281 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:06,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:06,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 15:22:06,301 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:06,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 15:22:06,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 15:22:06,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:22:06,303 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 15:22:06,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:06,500 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 15:22:06,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:22:06,502 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 15:22:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:06,503 INFO L225 Difference]: With dead ends: 20 [2018-12-03 15:22:06,503 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 15:22:06,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:22:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 15:22:06,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 15:22:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 15:22:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 15:22:06,514 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 15:22:06,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:06,514 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 15:22:06,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 15:22:06,515 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 15:22:06,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 15:22:06,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:06,515 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 15:22:06,516 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:06,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:06,516 INFO L82 PathProgramCache]: Analyzing trace with hash -771520671, now seen corresponding path program 14 times [2018-12-03 15:22:06,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:06,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:06,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:06,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:06,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:06,749 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:06,750 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:06,750 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:06,750 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:06,750 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:06,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:06,760 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:06,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:22:06,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:06,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:06,784 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:06,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:07,225 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:07,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:07,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 15:22:07,245 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:07,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:22:07,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:22:07,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:22:07,246 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 15:22:07,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:07,286 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 15:22:07,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 15:22:07,286 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 15:22:07,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:07,287 INFO L225 Difference]: With dead ends: 21 [2018-12-03 15:22:07,288 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:22:07,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:22:07,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:22:07,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 15:22:07,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:22:07,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 15:22:07,292 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 15:22:07,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:07,293 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 15:22:07,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:22:07,293 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 15:22:07,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 15:22:07,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:07,294 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 15:22:07,294 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:07,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:07,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1852661000, now seen corresponding path program 15 times [2018-12-03 15:22:07,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:07,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:07,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:07,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:07,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:07,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:07,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:07,553 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:07,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:07,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:07,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:07,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:07,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:07,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:07,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:07,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:07,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:08,118 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:08,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:08,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 15:22:08,139 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:08,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 15:22:08,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 15:22:08,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:22:08,141 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 15:22:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:08,174 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 15:22:08,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:22:08,174 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 15:22:08,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:08,175 INFO L225 Difference]: With dead ends: 22 [2018-12-03 15:22:08,175 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 15:22:08,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:22:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 15:22:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 15:22:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 15:22:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 15:22:08,180 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 15:22:08,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:08,180 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 15:22:08,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 15:22:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 15:22:08,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 15:22:08,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:08,181 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 15:22:08,181 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:08,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:08,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1597914177, now seen corresponding path program 16 times [2018-12-03 15:22:08,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:08,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:08,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:08,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:08,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:08,785 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:08,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:08,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:08,786 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:08,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:08,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:08,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:08,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:08,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:08,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:08,829 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:08,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:09,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:09,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 15:22:09,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:09,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 15:22:09,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 15:22:09,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:22:09,605 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 15:22:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:09,632 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 15:22:09,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:22:09,633 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 15:22:09,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:09,633 INFO L225 Difference]: With dead ends: 23 [2018-12-03 15:22:09,633 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 15:22:09,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 15:22:09,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 15:22:09,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 15:22:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:22:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 15:22:09,637 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 15:22:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:09,637 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 15:22:09,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 15:22:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 15:22:09,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:22:09,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:09,637 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 15:22:09,638 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:09,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:09,638 INFO L82 PathProgramCache]: Analyzing trace with hash -2004270040, now seen corresponding path program 17 times [2018-12-03 15:22:09,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:09,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:09,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:09,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:09,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:10,277 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:10,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:10,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:10,277 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:10,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:10,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:10,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:10,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:10,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:10,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 15:22:10,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:10,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:10,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:11,126 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:11,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:11,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 15:22:11,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:11,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 15:22:11,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 15:22:11,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:22:11,148 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 15:22:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:11,177 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 15:22:11,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:22:11,178 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 15:22:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:11,178 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:22:11,179 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 15:22:11,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:22:11,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 15:22:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 15:22:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 15:22:11,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 15:22:11,184 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 15:22:11,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:11,184 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 15:22:11,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 15:22:11,184 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 15:22:11,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 15:22:11,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:11,185 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 15:22:11,185 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:11,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:11,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2002831071, now seen corresponding path program 18 times [2018-12-03 15:22:11,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:11,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:11,187 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:11,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:11,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:11,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:12,270 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:12,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:12,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:12,271 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:12,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:12,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:12,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:12,281 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:12,282 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:12,306 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:12,306 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:12,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:12,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:12,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:12,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 15:22:12,855 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:12,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 15:22:12,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 15:22:12,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:22:12,857 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 15:22:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:12,896 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 15:22:12,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 15:22:12,896 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 15:22:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:12,897 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:22:12,897 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:22:12,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:22:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:22:12,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 15:22:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 15:22:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 15:22:12,902 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 15:22:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:12,902 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 15:22:12,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 15:22:12,902 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 15:22:12,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 15:22:12,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:12,903 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 15:22:12,903 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:12,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:12,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1958223032, now seen corresponding path program 19 times [2018-12-03 15:22:12,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:12,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:12,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:12,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:12,905 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:13,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:13,245 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:13,245 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:13,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:13,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:13,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:13,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:13,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:13,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:13,277 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:13,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:14,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:14,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 15:22:14,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:14,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 15:22:14,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 15:22:14,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:22:14,051 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 15:22:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:14,093 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 15:22:14,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:22:14,095 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 15:22:14,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:14,095 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:22:14,096 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 15:22:14,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:22:14,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 15:22:14,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 15:22:14,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:22:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 15:22:14,099 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 15:22:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:14,100 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 15:22:14,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 15:22:14,100 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 15:22:14,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:22:14,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:14,101 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 15:22:14,101 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:14,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:14,101 INFO L82 PathProgramCache]: Analyzing trace with hash -575373823, now seen corresponding path program 20 times [2018-12-03 15:22:14,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:14,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:14,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:14,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:14,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:14,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:14,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:14,423 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:14,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:14,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:14,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:14,433 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:14,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:14,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:22:14,460 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:14,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:14,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:14,980 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:14,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:14,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 15:22:14,999 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:15,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:22:15,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:22:15,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:22:15,001 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 15:22:15,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:15,072 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 15:22:15,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 15:22:15,073 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 15:22:15,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:15,074 INFO L225 Difference]: With dead ends: 27 [2018-12-03 15:22:15,074 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 15:22:15,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:22:15,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 15:22:15,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 15:22:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 15:22:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 15:22:15,078 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 15:22:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:15,078 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 15:22:15,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:22:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 15:22:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 15:22:15,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:15,079 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 15:22:15,079 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:15,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:15,079 INFO L82 PathProgramCache]: Analyzing trace with hash -656721304, now seen corresponding path program 21 times [2018-12-03 15:22:15,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:15,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:15,080 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:15,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:15,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:15,545 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:15,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:15,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:15,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:15,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:15,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:15,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:15,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:15,555 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:15,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:15,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:15,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:15,579 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:15,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:16,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:16,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 15:22:16,290 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:16,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 15:22:16,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 15:22:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:22:16,292 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 15:22:16,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:16,387 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 15:22:16,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 15:22:16,391 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 15:22:16,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:16,391 INFO L225 Difference]: With dead ends: 28 [2018-12-03 15:22:16,391 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:22:16,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 15:22:16,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:22:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 15:22:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 15:22:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 15:22:16,395 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 15:22:16,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:16,395 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 15:22:16,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 15:22:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 15:22:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 15:22:16,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:16,396 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 15:22:16,396 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:16,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:16,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1116474081, now seen corresponding path program 22 times [2018-12-03 15:22:16,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:16,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:16,398 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:16,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:16,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:16,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:16,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:16,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:16,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:16,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:16,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:16,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:16,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:16,674 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:16,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:16,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:17,432 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:17,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:17,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 15:22:17,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:17,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 15:22:17,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 15:22:17,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:22:17,454 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 15:22:17,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:17,489 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 15:22:17,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 15:22:17,490 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 15:22:17,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:17,490 INFO L225 Difference]: With dead ends: 29 [2018-12-03 15:22:17,490 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 15:22:17,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 15:22:17,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 15:22:17,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 15:22:17,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 15:22:17,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 15:22:17,496 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 15:22:17,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:17,496 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 15:22:17,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 15:22:17,496 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 15:22:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 15:22:17,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:17,497 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 15:22:17,497 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:17,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:17,498 INFO L82 PathProgramCache]: Analyzing trace with hash 250956168, now seen corresponding path program 23 times [2018-12-03 15:22:17,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:17,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:17,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:17,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:17,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:17,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:17,821 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:17,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:17,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:17,822 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:17,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:17,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:17,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:17,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:17,832 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:17,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:22:17,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:17,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:17,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:18,727 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:18,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:18,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 15:22:18,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:18,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:22:18,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:22:18,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:22:18,751 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 15:22:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:18,806 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 15:22:18,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:22:18,807 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 15:22:18,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:18,807 INFO L225 Difference]: With dead ends: 30 [2018-12-03 15:22:18,807 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:22:18,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:22:18,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:22:18,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 15:22:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:22:18,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 15:22:18,813 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 15:22:18,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:18,813 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 15:22:18,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:22:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 15:22:18,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:22:18,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:18,814 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 15:22:18,814 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:18,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:18,815 INFO L82 PathProgramCache]: Analyzing trace with hash -810295359, now seen corresponding path program 24 times [2018-12-03 15:22:18,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:18,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:18,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:18,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:18,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:19,483 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:19,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:19,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:19,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:19,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:19,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:19,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:19,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:19,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:19,523 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:19,523 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:19,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:19,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:20,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:20,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 15:22:20,712 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:20,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:22:20,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:22:20,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:20,713 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 15:22:20,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:20,767 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 15:22:20,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:22:20,768 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 15:22:20,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:20,768 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:22:20,769 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 15:22:20,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 15:22:20,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 15:22:20,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 15:22:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 15:22:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 15:22:20,774 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 15:22:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:20,774 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 15:22:20,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:22:20,774 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 15:22:20,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 15:22:20,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:20,775 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 15:22:20,775 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:20,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:20,776 INFO L82 PathProgramCache]: Analyzing trace with hash 650645672, now seen corresponding path program 25 times [2018-12-03 15:22:20,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:20,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:20,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:20,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:20,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:21,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:21,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:21,103 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:21,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:21,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:21,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:21,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:21,112 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:21,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:21,137 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:21,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:22,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:22,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 15:22:22,763 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:22,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 15:22:22,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 15:22:22,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:22:22,765 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 15:22:22,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:22,903 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 15:22:22,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 15:22:22,903 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 15:22:22,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:22,904 INFO L225 Difference]: With dead ends: 32 [2018-12-03 15:22:22,904 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 15:22:22,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 15:22:22,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 15:22:22,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 15:22:22,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 15:22:22,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 15:22:22,909 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 15:22:22,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:22,909 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 15:22:22,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 15:22:22,909 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 15:22:22,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 15:22:22,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:22,910 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 15:22:22,910 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:22,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:22,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1304822623, now seen corresponding path program 26 times [2018-12-03 15:22:22,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:22,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:22,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:22,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:22,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:23,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:23,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:23,286 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:23,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:23,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:23,286 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:23,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:23,296 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:23,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 15:22:23,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:23,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:23,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:24,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:24,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 15:22:24,244 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:24,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:22:24,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:22:24,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:22:24,246 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 15:22:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:24,511 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 15:22:24,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 15:22:24,512 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 15:22:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:24,513 INFO L225 Difference]: With dead ends: 33 [2018-12-03 15:22:24,513 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 15:22:24,514 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 15:22:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 15:22:24,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 15:22:24,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:22:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 15:22:24,519 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 15:22:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:24,519 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 15:22:24,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:22:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 15:22:24,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:22:24,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:24,519 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 15:22:24,520 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:24,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:24,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1794797624, now seen corresponding path program 27 times [2018-12-03 15:22:24,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:24,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:24,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:24,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:24,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:25,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:25,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:25,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:25,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:25,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:25,832 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:25,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:25,842 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:25,858 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:25,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:25,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:25,868 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:26,831 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:26,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:26,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 15:22:26,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:26,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 15:22:26,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 15:22:26,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:22:26,852 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 15:22:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:26,882 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 15:22:26,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:22:26,883 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 15:22:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:26,884 INFO L225 Difference]: With dead ends: 34 [2018-12-03 15:22:26,884 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 15:22:26,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:22:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 15:22:26,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 15:22:26,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 15:22:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 15:22:26,894 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 15:22:26,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:26,894 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 15:22:26,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 15:22:26,895 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 15:22:26,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 15:22:26,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:26,895 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 15:22:26,895 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:26,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:26,896 INFO L82 PathProgramCache]: Analyzing trace with hash 195846529, now seen corresponding path program 28 times [2018-12-03 15:22:26,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:26,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:26,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:26,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:26,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:27,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:27,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:27,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:27,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:27,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:27,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:27,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:27,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:27,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:27,420 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:27,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:28,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:28,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 15:22:28,426 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:28,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 15:22:28,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 15:22:28,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:22:28,428 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 15:22:28,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:28,507 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 15:22:28,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:22:28,508 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 15:22:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:28,509 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:22:28,509 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:22:28,510 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 [2018-12-03 15:22:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:22:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 15:22:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 15:22:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 15:22:28,512 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 15:22:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:28,513 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 15:22:28,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 15:22:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 15:22:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 15:22:28,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:28,514 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 15:22:28,514 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:28,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:28,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1776273128, now seen corresponding path program 29 times [2018-12-03 15:22:28,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:28,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:28,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:28,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:28,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:29,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:29,385 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:29,385 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:29,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:29,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:29,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:29,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:29,395 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:29,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:22:29,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:29,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:29,436 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:29,436 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:30,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:30,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 15:22:30,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:30,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:22:30,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:22:30,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:22:30,833 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 15:22:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:30,890 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 15:22:30,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:22:30,891 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 15:22:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:30,891 INFO L225 Difference]: With dead ends: 36 [2018-12-03 15:22:30,892 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:22:30,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:22:30,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:22:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:22:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:22:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 15:22:30,895 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 15:22:30,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:30,896 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 15:22:30,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:22:30,896 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 15:22:30,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 15:22:30,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:30,896 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 15:22:30,897 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:30,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:30,897 INFO L82 PathProgramCache]: Analyzing trace with hash -770109855, now seen corresponding path program 30 times [2018-12-03 15:22:30,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:30,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:30,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:30,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:30,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:32,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:32,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:32,182 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:32,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:32,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:32,182 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:32,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:32,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:32,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:32,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:32,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:32,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:33,493 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:33,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:33,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 15:22:33,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:33,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 15:22:33,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 15:22:33,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:22:33,515 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 15:22:33,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:33,570 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 15:22:33,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 15:22:33,571 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 15:22:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:33,571 INFO L225 Difference]: With dead ends: 37 [2018-12-03 15:22:33,571 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 15:22:33,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:22:33,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 15:22:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 15:22:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:22:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 15:22:33,574 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 15:22:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:33,574 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 15:22:33,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 15:22:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 15:22:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:22:33,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:33,575 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 15:22:33,575 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:33,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:33,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1896396296, now seen corresponding path program 31 times [2018-12-03 15:22:33,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:33,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:33,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:33,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:33,576 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:34,007 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:34,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:34,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:34,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:34,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:34,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:34,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:34,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:34,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:34,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:34,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:35,208 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:35,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:35,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 15:22:35,228 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:35,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 15:22:35,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 15:22:35,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:22:35,230 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 15:22:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:35,296 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 15:22:35,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:22:35,296 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 15:22:35,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:35,297 INFO L225 Difference]: With dead ends: 38 [2018-12-03 15:22:35,297 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 15:22:35,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:22:35,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 15:22:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 15:22:35,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 15:22:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 15:22:35,301 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 15:22:35,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:35,301 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 15:22:35,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 15:22:35,301 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 15:22:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 15:22:35,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:35,302 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 15:22:35,302 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:35,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:35,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1341258943, now seen corresponding path program 32 times [2018-12-03 15:22:35,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:35,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:35,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:35,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:35,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:36,147 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:36,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:36,148 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:36,148 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:36,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:36,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:36,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:36,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:36,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:36,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 15:22:36,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:36,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:36,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:37,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:37,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 15:22:37,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:37,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 15:22:37,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 15:22:37,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:22:37,583 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 15:22:37,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:37,669 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 15:22:37,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:22:37,669 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 15:22:37,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:37,669 INFO L225 Difference]: With dead ends: 39 [2018-12-03 15:22:37,669 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 15:22:37,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 15:22:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 15:22:37,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 15:22:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 15:22:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 15:22:37,672 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 15:22:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:37,672 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 15:22:37,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 15:22:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 15:22:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:22:37,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:37,673 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 15:22:37,673 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:37,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:37,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1370643752, now seen corresponding path program 33 times [2018-12-03 15:22:37,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:37,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:37,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:37,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:37,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:38,423 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:38,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:38,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:38,423 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:38,424 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:38,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:38,424 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:38,432 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:38,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:38,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:38,454 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:38,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:38,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:39,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:39,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 15:22:39,794 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:39,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 15:22:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 15:22:39,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:22:39,795 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 15:22:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:39,962 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 15:22:39,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:22:39,962 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 15:22:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:39,963 INFO L225 Difference]: With dead ends: 40 [2018-12-03 15:22:39,963 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 15:22:39,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:22:39,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 15:22:39,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 15:22:39,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 15:22:39,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 15:22:39,967 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 15:22:39,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:39,967 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 15:22:39,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 15:22:39,967 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 15:22:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 15:22:39,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:39,968 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 15:22:39,968 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:39,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:39,968 INFO L82 PathProgramCache]: Analyzing trace with hash -459718623, now seen corresponding path program 34 times [2018-12-03 15:22:39,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:39,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:39,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:39,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:39,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:39,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:40,499 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:40,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:40,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:40,500 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:40,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:40,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:40,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:40,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:40,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:40,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:40,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:42,175 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:42,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:42,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 15:22:42,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:42,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 15:22:42,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 15:22:42,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:22:42,195 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 15:22:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:42,264 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 15:22:42,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:22:42,264 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 15:22:42,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:42,265 INFO L225 Difference]: With dead ends: 41 [2018-12-03 15:22:42,265 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 15:22:42,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 15:22:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 15:22:42,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 15:22:42,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 15:22:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 15:22:42,273 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 15:22:42,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:42,273 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 15:22:42,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 15:22:42,273 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 15:22:42,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 15:22:42,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:42,274 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 15:22:42,274 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:42,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:42,274 INFO L82 PathProgramCache]: Analyzing trace with hash -1366377400, now seen corresponding path program 35 times [2018-12-03 15:22:42,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:42,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:42,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:42,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:42,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:42,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:42,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:42,835 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:42,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:42,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:42,836 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:42,845 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:42,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:42,870 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 15:22:42,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:42,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:42,881 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:42,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:44,784 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:44,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:44,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 15:22:44,805 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:44,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:22:44,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:22:44,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:22:44,806 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 15:22:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:44,853 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 15:22:44,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 15:22:44,854 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 15:22:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:44,855 INFO L225 Difference]: With dead ends: 42 [2018-12-03 15:22:44,855 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:22:44,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:22:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:22:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 15:22:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 15:22:44,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 15:22:44,858 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 15:22:44,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:44,858 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 15:22:44,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:22:44,858 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 15:22:44,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 15:22:44,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:44,859 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 15:22:44,859 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:44,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:44,859 INFO L82 PathProgramCache]: Analyzing trace with hash 591971585, now seen corresponding path program 36 times [2018-12-03 15:22:44,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:44,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:44,860 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:44,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:44,860 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:45,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:45,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:45,475 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:45,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:45,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:45,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:45,483 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:45,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:45,503 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:45,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:45,505 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:45,511 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:47,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:47,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 15:22:47,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:47,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 15:22:47,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 15:22:47,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:22:47,374 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 15:22:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:47,456 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 15:22:47,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:22:47,456 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 15:22:47,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:47,457 INFO L225 Difference]: With dead ends: 43 [2018-12-03 15:22:47,457 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 15:22:47,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 15:22:47,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 15:22:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 15:22:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 15:22:47,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 15:22:47,460 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 15:22:47,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:47,460 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 15:22:47,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 15:22:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 15:22:47,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 15:22:47,460 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:47,461 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 15:22:47,461 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:47,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:47,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1171247976, now seen corresponding path program 37 times [2018-12-03 15:22:47,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:47,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:47,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:47,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:47,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:48,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:48,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:48,065 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:48,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:48,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:48,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:48,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:48,073 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:48,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:48,106 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:48,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:49,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:49,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 15:22:49,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:49,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 15:22:49,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 15:22:49,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:22:49,887 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 15:22:49,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:49,951 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 15:22:49,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:22:49,951 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 15:22:49,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:49,952 INFO L225 Difference]: With dead ends: 44 [2018-12-03 15:22:49,952 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 15:22:49,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:22:49,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 15:22:49,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 15:22:49,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 15:22:49,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 15:22:49,955 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 15:22:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:49,955 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 15:22:49,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 15:22:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 15:22:49,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:22:49,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:49,956 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 15:22:49,956 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:49,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:49,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1948946913, now seen corresponding path program 38 times [2018-12-03 15:22:49,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:49,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:49,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:49,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:49,958 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:50,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:50,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:50,670 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:50,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:50,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:50,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:50,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:50,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:50,706 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:22:50,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:50,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:50,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:52,773 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:52,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:52,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 15:22:52,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:52,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 15:22:52,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 15:22:52,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:22:52,793 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 15:22:52,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:52,847 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 15:22:52,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 15:22:52,848 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 15:22:52,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:52,849 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:22:52,849 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 15:22:52,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:22:52,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 15:22:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 15:22:52,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 15:22:52,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 15:22:52,852 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 15:22:52,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:52,853 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 15:22:52,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 15:22:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 15:22:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 15:22:52,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:52,853 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 15:22:52,853 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:52,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:52,854 INFO L82 PathProgramCache]: Analyzing trace with hash 287810184, now seen corresponding path program 39 times [2018-12-03 15:22:52,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:52,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:52,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:52,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:52,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:53,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:53,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:53,549 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:53,549 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:53,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:53,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:53,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:53,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:53,585 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:53,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:53,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:53,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:55,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:55,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 15:22:55,542 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:55,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 15:22:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 15:22:55,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:22:55,543 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 15:22:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:55,611 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 15:22:55,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 15:22:55,612 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 15:22:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:55,612 INFO L225 Difference]: With dead ends: 46 [2018-12-03 15:22:55,612 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 15:22:55,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 15:22:55,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 15:22:55,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 15:22:55,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 15:22:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 15:22:55,615 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 15:22:55,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:55,616 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 15:22:55,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 15:22:55,616 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 15:22:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 15:22:55,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:55,616 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 15:22:55,617 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:55,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash 332179137, now seen corresponding path program 40 times [2018-12-03 15:22:55,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:55,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:55,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:55,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:55,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:56,641 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:56,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:56,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:56,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:56,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:56,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:56,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:56,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:56,650 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:56,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:56,684 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:58,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:58,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 15:22:58,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:58,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 15:22:58,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 15:22:58,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 15:22:58,541 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 15:22:58,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:58,629 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 15:22:58,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 15:22:58,630 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 15:22:58,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:58,631 INFO L225 Difference]: With dead ends: 47 [2018-12-03 15:22:58,631 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 15:22:58,632 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 [2018-12-03 15:22:58,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 15:22:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 15:22:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 15:22:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 15:22:58,633 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 15:22:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:58,633 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 15:22:58,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 15:22:58,633 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 15:22:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:22:58,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:58,634 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 15:22:58,634 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:58,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:58,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1707616680, now seen corresponding path program 41 times [2018-12-03 15:22:58,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:58,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:58,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:58,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:58,635 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:58,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:59,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:59,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:59,786 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:59,786 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:59,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:59,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:59,797 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:22:59,797 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:22:59,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:22:59,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:59,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:59,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:01,974 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:01,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:01,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 15:23:01,993 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:01,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:23:01,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:23:01,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:23:01,994 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 15:23:02,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:02,081 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 15:23:02,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:23:02,081 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 15:23:02,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:02,082 INFO L225 Difference]: With dead ends: 48 [2018-12-03 15:23:02,082 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 15:23:02,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:23:02,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 15:23:02,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 15:23:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 15:23:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 15:23:02,085 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 15:23:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:02,085 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 15:23:02,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:23:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 15:23:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 15:23:02,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:02,086 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 15:23:02,086 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:02,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:02,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1396507553, now seen corresponding path program 42 times [2018-12-03 15:23:02,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:02,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:02,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:02,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:02,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:02,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:02,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:02,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:02,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:02,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:02,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:02,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:02,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:02,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:02,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:02,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:02,878 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:02,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:04,988 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:05,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:05,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 15:23:05,007 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:05,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 15:23:05,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 15:23:05,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:23:05,009 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 15:23:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:05,060 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 15:23:05,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 15:23:05,060 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 15:23:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:05,061 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:23:05,061 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 15:23:05,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 15:23:05,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 15:23:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 15:23:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 15:23:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 15:23:05,065 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 15:23:05,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:05,065 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 15:23:05,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 15:23:05,065 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 15:23:05,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 15:23:05,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:05,066 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 15:23:05,066 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:05,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:05,067 INFO L82 PathProgramCache]: Analyzing trace with hash 342059208, now seen corresponding path program 43 times [2018-12-03 15:23:05,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:05,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:05,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:05,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:05,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:05,900 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:05,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:05,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:05,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:05,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:05,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:05,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:05,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:05,909 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:05,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:05,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:08,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:08,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 15:23:08,482 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:08,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 15:23:08,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 15:23:08,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:23:08,483 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 15:23:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:08,583 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 15:23:08,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 15:23:08,583 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 15:23:08,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:08,584 INFO L225 Difference]: With dead ends: 50 [2018-12-03 15:23:08,584 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 15:23:08,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 15:23:08,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 15:23:08,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 15:23:08,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 15:23:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 15:23:08,587 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 15:23:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:08,588 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 15:23:08,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 15:23:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 15:23:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 15:23:08,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:08,588 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 15:23:08,588 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:08,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:08,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2013898881, now seen corresponding path program 44 times [2018-12-03 15:23:08,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:08,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:08,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:08,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:08,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:09,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:09,400 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:09,401 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:09,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:09,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:09,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:09,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:09,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:09,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 15:23:09,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:09,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:09,452 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:09,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:11,867 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:11,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:11,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 15:23:11,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:11,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:23:11,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:23:11,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:23:11,888 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 15:23:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:11,943 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 15:23:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:23:11,944 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 15:23:11,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:11,945 INFO L225 Difference]: With dead ends: 51 [2018-12-03 15:23:11,945 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 15:23:11,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:23:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 15:23:11,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 15:23:11,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:23:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 15:23:11,949 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 15:23:11,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:11,949 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 15:23:11,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:23:11,949 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 15:23:11,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:23:11,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:11,950 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 15:23:11,950 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:11,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:11,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1993646104, now seen corresponding path program 45 times [2018-12-03 15:23:11,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:11,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:11,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:11,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:11,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:12,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:12,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:12,912 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:12,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:12,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:12,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:12,923 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:12,924 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:12,948 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:12,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:12,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:12,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:12,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:15,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:15,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:15,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 15:23:15,325 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:15,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 15:23:15,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 15:23:15,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:23:15,327 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 15:23:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:15,671 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 15:23:15,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:23:15,672 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 15:23:15,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:15,672 INFO L225 Difference]: With dead ends: 52 [2018-12-03 15:23:15,673 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:23:15,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:23:15,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:23:15,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 15:23:15,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:23:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 15:23:15,676 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 15:23:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:15,677 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 15:23:15,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 15:23:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 15:23:15,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 15:23:15,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:15,677 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 15:23:15,678 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:15,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:15,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1673489055, now seen corresponding path program 46 times [2018-12-03 15:23:15,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:15,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:15,679 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:15,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:15,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:17,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:17,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:17,323 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:17,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:17,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:17,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:17,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:17,333 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:17,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:17,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:17,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:19,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:19,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:19,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 15:23:19,903 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:19,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 15:23:19,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 15:23:19,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:23:19,904 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 15:23:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:19,989 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 15:23:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 15:23:19,989 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 15:23:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:19,990 INFO L225 Difference]: With dead ends: 53 [2018-12-03 15:23:19,990 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 15:23:19,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 15:23:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 15:23:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 15:23:19,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 15:23:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 15:23:19,993 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 15:23:19,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:19,993 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 15:23:19,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 15:23:19,993 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 15:23:19,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 15:23:19,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:19,994 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 15:23:19,994 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:19,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:19,994 INFO L82 PathProgramCache]: Analyzing trace with hash -338555128, now seen corresponding path program 47 times [2018-12-03 15:23:19,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:19,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:19,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:19,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:19,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:20,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:20,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:20,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:20,883 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:20,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:20,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:20,883 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:20,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:20,892 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:20,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 15:23:20,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:20,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:20,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:23,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:23,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 15:23:23,766 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:23,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:23:23,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:23:23,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:23:23,768 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 15:23:23,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:23,829 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 15:23:23,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:23:23,830 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 15:23:23,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:23,831 INFO L225 Difference]: With dead ends: 54 [2018-12-03 15:23:23,831 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 15:23:23,832 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 [2018-12-03 15:23:23,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 15:23:23,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 15:23:23,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:23:23,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 15:23:23,835 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 15:23:23,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:23,835 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 15:23:23,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:23:23,835 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 15:23:23,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:23:23,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:23,836 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 15:23:23,836 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:23,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:23,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1905276351, now seen corresponding path program 48 times [2018-12-03 15:23:23,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:23,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:23,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:23,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:23,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:23,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:24,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:24,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:24,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:24,931 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:24,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:24,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:24,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:24,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:24,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:24,966 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:24,966 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:24,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:24,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:27,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:27,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:27,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 15:23:27,864 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:27,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 15:23:27,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 15:23:27,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:23:27,865 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 15:23:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:28,018 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 15:23:28,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 15:23:28,019 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 15:23:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:28,019 INFO L225 Difference]: With dead ends: 55 [2018-12-03 15:23:28,020 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 15:23:28,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 15:23:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 15:23:28,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 15:23:28,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 15:23:28,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 15:23:28,023 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 15:23:28,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:28,024 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 15:23:28,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 15:23:28,024 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 15:23:28,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 15:23:28,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:28,024 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 15:23:28,025 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:28,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:28,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1065973288, now seen corresponding path program 49 times [2018-12-03 15:23:28,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:28,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:28,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:28,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:28,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:28,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:29,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:29,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:29,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:29,020 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:29,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:29,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:29,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:29,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:29,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:29,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:29,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:32,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:32,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 15:23:32,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:32,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 15:23:32,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 15:23:32,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:32,349 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 15:23:32,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:32,426 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 15:23:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:23:32,426 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 15:23:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:32,427 INFO L225 Difference]: With dead ends: 56 [2018-12-03 15:23:32,427 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:23:32,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:23:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:23:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 15:23:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 15:23:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 15:23:32,431 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 15:23:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:32,431 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 15:23:32,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 15:23:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 15:23:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 15:23:32,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:32,431 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 15:23:32,432 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:32,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:32,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1314568415, now seen corresponding path program 50 times [2018-12-03 15:23:32,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:32,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:32,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:32,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:32,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:32,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:33,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:33,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:33,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:33,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:33,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:33,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:33,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:33,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:33,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:33,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 15:23:33,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:33,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:33,686 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:36,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:36,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 15:23:36,688 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:36,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:23:36,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:23:36,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:23:36,690 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 15:23:36,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:36,839 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 15:23:36,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 15:23:36,839 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 15:23:36,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:36,840 INFO L225 Difference]: With dead ends: 57 [2018-12-03 15:23:36,841 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 15:23:36,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:23:36,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 15:23:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 15:23:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 15:23:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 15:23:36,844 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 15:23:36,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:36,844 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 15:23:36,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:23:36,844 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 15:23:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 15:23:36,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:36,845 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 15:23:36,845 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:36,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:36,845 INFO L82 PathProgramCache]: Analyzing trace with hash -2096917176, now seen corresponding path program 51 times [2018-12-03 15:23:36,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:36,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:36,846 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:36,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:36,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:38,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:38,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:38,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:38,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:38,181 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:38,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:38,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:38,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:38,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:38,226 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:38,227 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:38,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:38,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:38,237 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:41,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:41,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:41,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 15:23:41,293 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:41,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 15:23:41,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 15:23:41,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:23:41,295 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 15:23:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:41,383 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 15:23:41,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:23:41,384 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 15:23:41,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:41,385 INFO L225 Difference]: With dead ends: 58 [2018-12-03 15:23:41,385 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 15:23:41,386 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 [2018-12-03 15:23:41,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 15:23:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 15:23:41,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 15:23:41,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 15:23:41,389 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 15:23:41,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:41,389 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 15:23:41,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 15:23:41,389 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 15:23:41,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 15:23:41,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:41,390 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 15:23:41,390 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:41,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:41,390 INFO L82 PathProgramCache]: Analyzing trace with hash -579924991, now seen corresponding path program 52 times [2018-12-03 15:23:41,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:41,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:41,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:41,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:41,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:42,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:42,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:42,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:42,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:42,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:42,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:42,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:42,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:42,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:42,785 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:45,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:45,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:45,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 15:23:45,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:45,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:23:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:23:45,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:23:45,866 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 15:23:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:45,965 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 15:23:45,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:23:45,971 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 15:23:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:45,972 INFO L225 Difference]: With dead ends: 59 [2018-12-03 15:23:45,972 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:23:45,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 15:23:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:23:45,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 15:23:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:23:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 15:23:45,974 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 15:23:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:45,975 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 15:23:45,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:23:45,975 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 15:23:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 15:23:45,975 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:45,975 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 15:23:45,976 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:45,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:45,976 INFO L82 PathProgramCache]: Analyzing trace with hash -797807512, now seen corresponding path program 53 times [2018-12-03 15:23:45,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:45,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:45,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:45,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:45,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:47,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:47,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:47,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:47,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:47,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:47,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:47,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:47,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:23:47,062 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:23:47,103 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 15:23:47,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:47,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:47,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:47,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:50,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:50,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 15:23:50,575 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:50,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 15:23:50,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 15:23:50,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 15:23:50,577 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 15:23:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:50,648 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 15:23:50,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 15:23:50,649 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 15:23:50,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:50,650 INFO L225 Difference]: With dead ends: 60 [2018-12-03 15:23:50,650 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:23:50,651 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 [2018-12-03 15:23:50,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:23:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 15:23:50,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 15:23:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 15:23:50,654 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 15:23:50,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:50,654 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 15:23:50,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 15:23:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 15:23:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 15:23:50,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:50,655 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 15:23:50,655 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:50,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:50,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1037768929, now seen corresponding path program 54 times [2018-12-03 15:23:50,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:50,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:50,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:50,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:50,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:52,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:52,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:52,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:52,074 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:52,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:52,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:52,074 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:52,084 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:23:52,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:23:52,115 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:23:52,116 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:23:52,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:52,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:23:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:55,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:23:55,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 15:23:55,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:23:55,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 15:23:55,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 15:23:55,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:23:55,606 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 15:23:55,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:23:55,697 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 15:23:55,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 15:23:55,698 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 15:23:55,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:23:55,699 INFO L225 Difference]: With dead ends: 61 [2018-12-03 15:23:55,699 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 15:23:55,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 15:23:55,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 15:23:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 15:23:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:23:55,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 15:23:55,702 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 15:23:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:23:55,703 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 15:23:55,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 15:23:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 15:23:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:23:55,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:23:55,703 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 15:23:55,703 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:23:55,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:23:55,704 INFO L82 PathProgramCache]: Analyzing trace with hash 2106063752, now seen corresponding path program 55 times [2018-12-03 15:23:55,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:23:55,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:55,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:23:55,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:23:55,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:23:55,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:56,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:56,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:23:56,935 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:23:56,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:23:56,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:23:56,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:23:56,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:23:56,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:23:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:23:56,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:23:56,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:23:56,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:00,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:00,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 15:24:00,629 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:00,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 15:24:00,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 15:24:00,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:24:00,631 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 15:24:00,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:00,747 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 15:24:00,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:24:00,747 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 15:24:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:00,748 INFO L225 Difference]: With dead ends: 62 [2018-12-03 15:24:00,748 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 15:24:00,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:24:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 15:24:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 15:24:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 15:24:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 15:24:00,752 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 15:24:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:00,752 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 15:24:00,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 15:24:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 15:24:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 15:24:00,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:00,753 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 15:24:00,753 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:00,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:00,753 INFO L82 PathProgramCache]: Analyzing trace with hash 863464897, now seen corresponding path program 56 times [2018-12-03 15:24:00,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:00,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:00,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:00,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:00,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:00,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:02,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:02,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:02,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:02,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:02,029 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:02,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:02,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:02,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:24:02,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:24:02,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 15:24:02,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:02,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:02,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:05,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:05,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:05,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 15:24:05,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:05,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:24:05,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:24:05,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:24:05,958 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 15:24:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:06,035 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 15:24:06,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:24:06,036 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 15:24:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:06,036 INFO L225 Difference]: With dead ends: 63 [2018-12-03 15:24:06,036 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:24:06,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 15:24:06,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:24:06,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 15:24:06,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 15:24:06,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 15:24:06,041 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 15:24:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:06,041 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 15:24:06,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:24:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 15:24:06,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 15:24:06,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:06,042 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 15:24:06,042 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:06,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:06,043 INFO L82 PathProgramCache]: Analyzing trace with hash 997606056, now seen corresponding path program 57 times [2018-12-03 15:24:06,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:06,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:06,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:06,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:06,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:07,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:07,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:07,357 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:07,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:07,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:07,357 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:07,365 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:24:07,365 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:24:07,396 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:24:07,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:07,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:07,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:11,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:11,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 15:24:11,295 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:11,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 15:24:11,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 15:24:11,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:24:11,297 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 15:24:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:11,396 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 15:24:11,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:24:11,396 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 15:24:11,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:11,397 INFO L225 Difference]: With dead ends: 64 [2018-12-03 15:24:11,397 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 15:24:11,398 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 [2018-12-03 15:24:11,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 15:24:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 15:24:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 15:24:11,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 15:24:11,403 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 15:24:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:11,404 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 15:24:11,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 15:24:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 15:24:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 15:24:11,404 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:11,404 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 15:24:11,405 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:11,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:11,405 INFO L82 PathProgramCache]: Analyzing trace with hash 861014689, now seen corresponding path program 58 times [2018-12-03 15:24:11,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:11,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:11,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:11,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:11,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:12,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:12,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:12,744 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:12,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:12,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:12,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:12,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:12,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:24:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:12,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:12,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:16,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:16,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:16,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 15:24:16,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:16,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 15:24:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 15:24:16,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:24:16,841 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 15:24:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:16,926 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 15:24:16,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 15:24:16,927 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 15:24:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:16,928 INFO L225 Difference]: With dead ends: 65 [2018-12-03 15:24:16,928 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 15:24:16,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:24:16,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 15:24:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 15:24:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:24:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 15:24:16,932 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 15:24:16,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:16,932 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 15:24:16,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 15:24:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 15:24:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:24:16,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:16,933 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 15:24:16,933 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:16,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash 921649608, now seen corresponding path program 59 times [2018-12-03 15:24:16,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:16,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:16,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:16,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:16,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:18,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:18,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:18,976 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:18,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:18,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:18,977 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:18,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:24:18,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:24:19,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 15:24:19,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:19,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:19,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:22,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:22,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:22,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 15:24:22,949 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:22,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 15:24:22,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 15:24:22,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:24:22,951 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 15:24:23,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:23,029 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 15:24:23,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:24:23,029 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 15:24:23,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:23,030 INFO L225 Difference]: With dead ends: 66 [2018-12-03 15:24:23,030 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 15:24:23,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:24:23,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 15:24:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 15:24:23,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 15:24:23,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 15:24:23,034 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 15:24:23,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:23,034 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 15:24:23,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 15:24:23,034 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 15:24:23,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 15:24:23,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:23,034 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 15:24:23,035 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:23,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:23,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1493635199, now seen corresponding path program 60 times [2018-12-03 15:24:23,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:23,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:23,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:23,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:23,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:24,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:24,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:24,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:24,687 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:24,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:24,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:24,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:24,698 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:24:24,698 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:24:24,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:24:24,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:24,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:24,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:29,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:29,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:29,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 15:24:29,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:29,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 15:24:29,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 15:24:29,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:24:29,069 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 15:24:29,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:29,174 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 15:24:29,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:24:29,174 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 15:24:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:29,175 INFO L225 Difference]: With dead ends: 67 [2018-12-03 15:24:29,175 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 15:24:29,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 15:24:29,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 15:24:29,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 15:24:29,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 15:24:29,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 15:24:29,179 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 15:24:29,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:29,179 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 15:24:29,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 15:24:29,179 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 15:24:29,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 15:24:29,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:29,179 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 15:24:29,180 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:29,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:29,180 INFO L82 PathProgramCache]: Analyzing trace with hash 941947112, now seen corresponding path program 61 times [2018-12-03 15:24:29,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:29,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:29,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:29,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:29,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:30,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:30,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:30,616 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:30,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:30,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:30,617 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:30,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:30,625 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:24:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:30,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:30,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:30,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:35,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:35,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 15:24:35,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:35,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 15:24:35,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 15:24:35,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:24:35,202 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 15:24:35,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:35,313 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 15:24:35,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:24:35,313 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 15:24:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:35,314 INFO L225 Difference]: With dead ends: 68 [2018-12-03 15:24:35,314 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 15:24:35,315 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 [2018-12-03 15:24:35,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 15:24:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 15:24:35,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:24:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 15:24:35,318 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 15:24:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:35,318 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 15:24:35,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 15:24:35,318 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 15:24:35,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:24:35,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:35,319 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 15:24:35,319 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:35,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:35,319 INFO L82 PathProgramCache]: Analyzing trace with hash -864412575, now seen corresponding path program 62 times [2018-12-03 15:24:35,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:35,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:35,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:35,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:35,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:36,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:36,807 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:36,807 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:36,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:36,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:36,808 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:36,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:24:36,818 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:24:36,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 15:24:36,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:36,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:36,878 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:41,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:41,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 15:24:41,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:41,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:24:41,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:24:41,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:24:41,502 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 15:24:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:41,637 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 15:24:41,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 15:24:41,638 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 15:24:41,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:41,639 INFO L225 Difference]: With dead ends: 69 [2018-12-03 15:24:41,639 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 15:24:41,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 15:24:41,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 15:24:41,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 15:24:41,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 15:24:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 15:24:41,643 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 15:24:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:41,643 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 15:24:41,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:24:41,643 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 15:24:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 15:24:41,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:41,643 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 15:24:41,644 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:41,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:41,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1026988024, now seen corresponding path program 63 times [2018-12-03 15:24:41,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:41,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:41,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:41,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:41,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:43,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:43,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:43,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:43,166 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:43,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:43,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:43,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:24:43,176 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:24:43,176 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:24:43,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:24:43,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:43,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:43,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:43,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:48,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:48,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 15:24:48,133 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:48,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 15:24:48,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 15:24:48,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:24:48,134 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 15:24:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:48,254 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 15:24:48,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 15:24:48,257 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 15:24:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:48,258 INFO L225 Difference]: With dead ends: 70 [2018-12-03 15:24:48,258 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 15:24:48,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:24:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 15:24:48,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 15:24:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 15:24:48,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 15:24:48,261 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 15:24:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:48,262 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 15:24:48,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 15:24:48,262 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 15:24:48,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 15:24:48,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:48,262 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 15:24:48,263 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:48,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:48,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1771859647, now seen corresponding path program 64 times [2018-12-03 15:24:48,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:48,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:48,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:24:48,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:48,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:50,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:50,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:50,113 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:50,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:50,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:50,113 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:24:50,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:50,122 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:24:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:50,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:50,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:24:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:55,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:24:55,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 15:24:55,120 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:24:55,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 15:24:55,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 15:24:55,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:24:55,122 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 15:24:55,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:24:55,204 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 15:24:55,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:24:55,205 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 15:24:55,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:24:55,205 INFO L225 Difference]: With dead ends: 71 [2018-12-03 15:24:55,205 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 15:24:55,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 15:24:55,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 15:24:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 15:24:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 15:24:55,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 15:24:55,209 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 15:24:55,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:24:55,209 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 15:24:55,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 15:24:55,209 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 15:24:55,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 15:24:55,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:24:55,210 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 15:24:55,210 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:24:55,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:24:55,210 INFO L82 PathProgramCache]: Analyzing trace with hash 906923816, now seen corresponding path program 65 times [2018-12-03 15:24:55,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:24:55,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:55,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:24:55,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:24:55,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:24:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:24:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:57,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:57,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:24:57,435 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:24:57,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:24:57,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:24:57,436 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:24:57,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:24:57,445 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:24:57,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 15:24:57,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:24:57,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:24:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:24:57,514 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:02,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:02,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 15:25:02,443 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:02,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 15:25:02,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 15:25:02,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:25:02,445 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 15:25:02,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:02,553 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 15:25:02,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:25:02,554 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 15:25:02,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:02,555 INFO L225 Difference]: With dead ends: 72 [2018-12-03 15:25:02,555 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 15:25:02,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:25:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 15:25:02,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 15:25:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:25:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 15:25:02,559 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 15:25:02,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:02,560 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 15:25:02,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 15:25:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 15:25:02,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 15:25:02,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:02,561 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 15:25:02,561 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:02,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:02,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1950134751, now seen corresponding path program 66 times [2018-12-03 15:25:02,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:02,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:02,562 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:02,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:02,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:04,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:04,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:04,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:04,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:04,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:04,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:25:04,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:25:04,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:25:04,530 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:25:04,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:04,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:04,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:09,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:09,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:09,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 15:25:09,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:09,767 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 15:25:09,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 15:25:09,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:25:09,768 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 15:25:10,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:10,060 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 15:25:10,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 15:25:10,061 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 15:25:10,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:10,061 INFO L225 Difference]: With dead ends: 73 [2018-12-03 15:25:10,061 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 15:25:10,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 15:25:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 15:25:10,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 15:25:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 15:25:10,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 15:25:10,064 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 15:25:10,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:10,064 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 15:25:10,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 15:25:10,064 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 15:25:10,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 15:25:10,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:10,065 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 15:25:10,065 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:10,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:10,065 INFO L82 PathProgramCache]: Analyzing trace with hash -324637112, now seen corresponding path program 67 times [2018-12-03 15:25:10,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:10,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:10,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:10,066 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:11,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:11,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:11,705 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:11,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:11,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:11,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:25:11,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:11,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:25:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:11,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:11,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:17,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:17,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 15:25:17,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:17,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 15:25:17,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 15:25:17,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:25:17,032 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 15:25:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:17,129 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 15:25:17,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 15:25:17,129 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 15:25:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:17,130 INFO L225 Difference]: With dead ends: 74 [2018-12-03 15:25:17,130 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 15:25:17,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 15:25:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 15:25:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 15:25:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 15:25:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 15:25:17,134 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 15:25:17,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:17,135 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 15:25:17,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 15:25:17,135 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 15:25:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 15:25:17,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:17,135 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 15:25:17,135 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:17,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:17,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1473817855, now seen corresponding path program 68 times [2018-12-03 15:25:17,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:17,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:17,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:17,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:17,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:18,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:18,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:18,892 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:18,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:18,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:18,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:25:18,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:25:18,901 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:25:18,961 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 15:25:18,961 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:18,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:18,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:24,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:24,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 15:25:24,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:24,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:25:24,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:25:24,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:25:24,442 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 15:25:24,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:24,693 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 15:25:24,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 15:25:24,694 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 15:25:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:24,694 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:25:24,694 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 15:25:24,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:25:24,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 15:25:24,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 15:25:24,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:25:24,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 15:25:24,698 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 15:25:24,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:24,698 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 15:25:24,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:25:24,698 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 15:25:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 15:25:24,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:24,699 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 15:25:24,699 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:24,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1556284776, now seen corresponding path program 69 times [2018-12-03 15:25:24,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:24,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:24,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:24,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:24,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:26,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:26,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:26,598 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:26,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:26,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:26,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:25:26,607 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:25:26,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:25:26,667 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:25:26,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:26,670 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:26,687 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:32,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:32,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:32,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 15:25:32,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:32,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 15:25:32,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 15:25:32,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:25:32,353 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 15:25:32,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:32,478 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 15:25:32,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 15:25:32,478 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 15:25:32,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:32,479 INFO L225 Difference]: With dead ends: 76 [2018-12-03 15:25:32,480 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 15:25:32,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:25:32,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 15:25:32,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 15:25:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:25:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 15:25:32,484 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 15:25:32,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:32,484 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 15:25:32,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 15:25:32,484 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 15:25:32,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 15:25:32,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:32,485 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 15:25:32,485 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:32,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:32,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1000185825, now seen corresponding path program 70 times [2018-12-03 15:25:32,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:32,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:32,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:32,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:32,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:34,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:34,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:34,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:34,337 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:34,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:34,337 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:25:34,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:34,345 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:25:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:34,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:34,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:34,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:40,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:40,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:40,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 15:25:40,349 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:40,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 15:25:40,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 15:25:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:25:40,351 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 15:25:40,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:40,491 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 15:25:40,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 15:25:40,491 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 15:25:40,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:40,492 INFO L225 Difference]: With dead ends: 77 [2018-12-03 15:25:40,492 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:25:40,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 15:25:40,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:25:40,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 15:25:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 15:25:40,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 15:25:40,497 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 15:25:40,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:40,497 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 15:25:40,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 15:25:40,497 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 15:25:40,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 15:25:40,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:40,498 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 15:25:40,498 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:40,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:40,499 INFO L82 PathProgramCache]: Analyzing trace with hash 940987528, now seen corresponding path program 71 times [2018-12-03 15:25:40,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:40,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:40,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:25:40,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:40,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:42,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:42,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:42,831 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:42,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:42,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:42,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:25:42,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:25:42,840 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:25:42,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 15:25:42,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:42,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:42,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:48,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:48,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:48,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 15:25:48,886 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:48,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:25:48,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:25:48,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:25:48,888 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 15:25:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:49,033 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 15:25:49,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 15:25:49,034 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 15:25:49,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:49,035 INFO L225 Difference]: With dead ends: 78 [2018-12-03 15:25:49,035 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 15:25:49,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 15:25:49,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 15:25:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 15:25:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 15:25:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 15:25:49,039 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 15:25:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:49,040 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 15:25:49,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:25:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 15:25:49,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 15:25:49,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:49,041 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 15:25:49,041 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:49,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:49,041 INFO L82 PathProgramCache]: Analyzing trace with hash -894159679, now seen corresponding path program 72 times [2018-12-03 15:25:49,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:49,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:49,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:49,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:49,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:25:51,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:51,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:51,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:25:51,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:25:51,322 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:25:51,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:25:51,322 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:25:51,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:25:51,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:25:51,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:25:51,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:25:51,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:25:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:51,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:25:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:25:57,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:25:57,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 15:25:57,546 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:25:57,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 15:25:57,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 15:25:57,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 15:25:57,547 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 15:25:57,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:25:57,683 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 15:25:57,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 15:25:57,684 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 15:25:57,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:25:57,684 INFO L225 Difference]: With dead ends: 79 [2018-12-03 15:25:57,685 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 15:25:57,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 15:25:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 15:25:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 15:25:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 15:25:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 15:25:57,689 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 15:25:57,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:25:57,689 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 15:25:57,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 15:25:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 15:25:57,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 15:25:57,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:25:57,690 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 15:25:57,691 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:25:57,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:25:57,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1949148248, now seen corresponding path program 73 times [2018-12-03 15:25:57,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:25:57,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:57,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:25:57,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:25:57,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:25:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:00,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:00,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:00,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:00,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:00,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:00,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:00,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:26:00,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:00,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:26:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:00,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:00,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:07,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:07,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 15:26:07,149 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:07,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 15:26:07,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 15:26:07,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:26:07,150 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 15:26:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:07,295 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 15:26:07,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:26:07,296 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 15:26:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:07,297 INFO L225 Difference]: With dead ends: 80 [2018-12-03 15:26:07,297 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 15:26:07,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:26:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 15:26:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 15:26:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 15:26:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 15:26:07,301 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 15:26:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:07,301 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 15:26:07,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 15:26:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 15:26:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 15:26:07,301 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:07,301 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 15:26:07,302 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:07,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:07,302 INFO L82 PathProgramCache]: Analyzing trace with hash -294055519, now seen corresponding path program 74 times [2018-12-03 15:26:07,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:07,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:07,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:07,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:07,303 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:09,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:09,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:09,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:09,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:09,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:09,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:09,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:26:09,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:26:09,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:26:09,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 15:26:09,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:09,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:09,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:16,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:16,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 15:26:16,070 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:16,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 15:26:16,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 15:26:16,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:26:16,071 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 15:26:16,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:16,174 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 15:26:16,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 15:26:16,174 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 15:26:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:16,175 INFO L225 Difference]: With dead ends: 81 [2018-12-03 15:26:16,175 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 15:26:16,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 15:26:16,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 15:26:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 15:26:16,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 15:26:16,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 15:26:16,179 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 15:26:16,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:16,179 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 15:26:16,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 15:26:16,180 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 15:26:16,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 15:26:16,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:16,180 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 15:26:16,181 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:16,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:16,181 INFO L82 PathProgramCache]: Analyzing trace with hash -525788472, now seen corresponding path program 75 times [2018-12-03 15:26:16,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:16,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:16,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:16,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:16,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:18,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:18,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:18,906 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:18,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:18,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:18,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:26:18,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:26:18,914 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:26:18,954 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:26:18,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:18,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:18,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:18,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:25,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:25,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:25,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 15:26:25,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:25,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 15:26:25,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 15:26:25,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:26:25,571 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 15:26:25,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:25,974 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 15:26:25,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 15:26:25,974 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 15:26:25,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:25,974 INFO L225 Difference]: With dead ends: 82 [2018-12-03 15:26:25,974 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 15:26:25,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 15:26:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 15:26:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 15:26:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 15:26:25,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 15:26:25,978 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 15:26:25,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:25,978 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 15:26:25,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 15:26:25,978 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 15:26:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 15:26:25,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:25,979 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 15:26:25,979 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:25,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:25,979 INFO L82 PathProgramCache]: Analyzing trace with hash 880424577, now seen corresponding path program 76 times [2018-12-03 15:26:25,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:25,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:25,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:25,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:25,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:28,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:28,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:28,283 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:28,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:28,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:28,283 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:26:28,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:28,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:26:28,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:28,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:28,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:34,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:35,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:35,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 15:26:35,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:35,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 15:26:35,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 15:26:35,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 15:26:35,011 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 15:26:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:35,263 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 15:26:35,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 15:26:35,263 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 15:26:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:35,264 INFO L225 Difference]: With dead ends: 83 [2018-12-03 15:26:35,264 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 15:26:35,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 15:26:35,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 15:26:35,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 15:26:35,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 15:26:35,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 15:26:35,267 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 15:26:35,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:35,268 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 15:26:35,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 15:26:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 15:26:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 15:26:35,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:35,268 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 15:26:35,268 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:35,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:35,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1523356136, now seen corresponding path program 77 times [2018-12-03 15:26:35,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:35,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:35,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:35,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:35,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:38,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:38,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:38,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:38,503 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:38,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:38,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:38,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:26:38,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:26:38,512 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:26:38,571 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 15:26:38,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:38,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:38,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:38,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:45,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:45,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 15:26:45,544 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:45,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 15:26:45,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 15:26:45,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:26:45,546 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 15:26:46,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:46,155 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 15:26:46,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 15:26:46,156 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 15:26:46,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:46,156 INFO L225 Difference]: With dead ends: 84 [2018-12-03 15:26:46,156 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 15:26:46,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:26:46,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 15:26:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 15:26:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 15:26:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 15:26:46,160 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 15:26:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:46,161 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 15:26:46,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 15:26:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 15:26:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 15:26:46,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:46,161 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 15:26:46,162 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:46,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:46,162 INFO L82 PathProgramCache]: Analyzing trace with hash -20602015, now seen corresponding path program 78 times [2018-12-03 15:26:46,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:46,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:46,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:46,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:46,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:49,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:49,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:49,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:49,923 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:49,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:49,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:49,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:26:49,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:26:49,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:26:49,982 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:26:49,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:26:49,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:50,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:26:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:57,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:26:57,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 15:26:57,273 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:26:57,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 15:26:57,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 15:26:57,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 15:26:57,275 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 15:26:57,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:26:57,419 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 15:26:57,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 15:26:57,419 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 15:26:57,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:26:57,420 INFO L225 Difference]: With dead ends: 85 [2018-12-03 15:26:57,420 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 15:26:57,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 15:26:57,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 15:26:57,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 15:26:57,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 15:26:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 15:26:57,424 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 15:26:57,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:26:57,424 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 15:26:57,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 15:26:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 15:26:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 15:26:57,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:26:57,424 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 15:26:57,425 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:26:57,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:26:57,425 INFO L82 PathProgramCache]: Analyzing trace with hash -638664440, now seen corresponding path program 79 times [2018-12-03 15:26:57,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:26:57,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:57,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:26:57,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:26:57,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:26:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:59,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:59,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:26:59,877 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:26:59,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:26:59,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:26:59,877 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:26:59,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:26:59,887 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:26:59,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:26:59,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:26:59,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:26:59,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:07,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:07,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 15:27:07,535 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:07,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 15:27:07,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 15:27:07,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:27:07,537 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 15:27:07,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:07,646 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 15:27:07,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 15:27:07,647 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 15:27:07,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:07,647 INFO L225 Difference]: With dead ends: 86 [2018-12-03 15:27:07,648 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 15:27:07,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 15:27:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 15:27:07,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 15:27:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:27:07,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 15:27:07,651 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 15:27:07,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:07,651 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 15:27:07,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 15:27:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 15:27:07,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 15:27:07,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:07,652 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 15:27:07,652 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:07,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:07,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1676236865, now seen corresponding path program 80 times [2018-12-03 15:27:07,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:07,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:07,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:07,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:07,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:10,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:10,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:10,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:10,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:10,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:10,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:10,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:27:10,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:27:10,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:27:10,076 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 15:27:10,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:10,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:10,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:18,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:18,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 15:27:18,535 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:18,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 15:27:18,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 15:27:18,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:27:18,537 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 15:27:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:18,726 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 15:27:18,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 15:27:18,727 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 15:27:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:18,728 INFO L225 Difference]: With dead ends: 87 [2018-12-03 15:27:18,728 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:27:18,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:27:18,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:27:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 15:27:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 15:27:18,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 15:27:18,732 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 15:27:18,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:18,732 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 15:27:18,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 15:27:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 15:27:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 15:27:18,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:18,732 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 15:27:18,733 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:18,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:18,733 INFO L82 PathProgramCache]: Analyzing trace with hash 423733288, now seen corresponding path program 81 times [2018-12-03 15:27:18,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:18,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:18,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:18,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:18,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:21,625 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:21,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:21,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:21,626 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:21,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:21,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:21,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:27:21,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:27:21,634 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:27:21,677 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:27:21,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:21,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:21,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:29,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:29,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 15:27:29,489 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:29,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 15:27:29,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 15:27:29,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:27:29,490 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 15:27:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:29,655 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 15:27:29,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 15:27:29,656 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 15:27:29,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:29,656 INFO L225 Difference]: With dead ends: 88 [2018-12-03 15:27:29,656 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 15:27:29,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 15:27:29,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 15:27:29,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 15:27:29,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 15:27:29,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 15:27:29,659 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 15:27:29,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:29,659 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 15:27:29,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 15:27:29,659 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 15:27:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 15:27:29,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:29,660 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 15:27:29,660 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:29,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:29,660 INFO L82 PathProgramCache]: Analyzing trace with hash 250828065, now seen corresponding path program 82 times [2018-12-03 15:27:29,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:29,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:29,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:29,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:29,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:32,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:32,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:32,133 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:32,134 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:32,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:32,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:32,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:27:32,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:32,144 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:27:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:32,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:32,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:41,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:41,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 15:27:41,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:41,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 15:27:41,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 15:27:41,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 15:27:41,318 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 15:27:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:41,464 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 15:27:41,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 15:27:41,465 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 15:27:41,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:41,465 INFO L225 Difference]: With dead ends: 89 [2018-12-03 15:27:41,466 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 15:27:41,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 15:27:41,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 15:27:41,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 15:27:41,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 15:27:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 15:27:41,469 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 15:27:41,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:41,470 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 15:27:41,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 15:27:41,470 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 15:27:41,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 15:27:41,470 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:41,470 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 15:27:41,470 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:41,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:41,471 INFO L82 PathProgramCache]: Analyzing trace with hash -814266552, now seen corresponding path program 83 times [2018-12-03 15:27:41,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:41,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:41,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:27:41,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:41,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:41,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:44,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:44,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:44,478 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:44,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:44,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:44,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:27:44,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:27:44,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:27:44,554 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 15:27:44,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:44,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:44,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:44,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:27:52,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:52,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:27:52,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 15:27:52,356 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:27:52,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:27:52,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:27:52,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:27:52,357 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 15:27:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:27:52,494 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 15:27:52,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:27:52,495 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 15:27:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:27:52,496 INFO L225 Difference]: With dead ends: 90 [2018-12-03 15:27:52,496 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 15:27:52,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 15:27:52,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 15:27:52,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 15:27:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 15:27:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 15:27:52,500 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 15:27:52,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:27:52,501 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 15:27:52,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:27:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 15:27:52,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 15:27:52,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:27:52,501 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 15:27:52,502 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:27:52,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:27:52,502 INFO L82 PathProgramCache]: Analyzing trace with hash 527538689, now seen corresponding path program 84 times [2018-12-03 15:27:52,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:27:52,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:52,503 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:27:52,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:27:52,503 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:27:52,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:27:55,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:55,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:55,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:27:55,294 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:27:55,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:27:55,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:27:55,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:27:55,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:27:55,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:27:55,347 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:27:55,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:27:55,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:27:55,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:27:55,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:03,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:03,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 15:28:03,741 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:03,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 15:28:03,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 15:28:03,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:28:03,743 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 15:28:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:03,890 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 15:28:03,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 15:28:03,891 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 15:28:03,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:03,892 INFO L225 Difference]: With dead ends: 91 [2018-12-03 15:28:03,892 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 15:28:03,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 15:28:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 15:28:03,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 15:28:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 15:28:03,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 15:28:03,897 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 15:28:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:03,897 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 15:28:03,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 15:28:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 15:28:03,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 15:28:03,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:03,898 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 15:28:03,898 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:03,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:03,898 INFO L82 PathProgramCache]: Analyzing trace with hash -826171800, now seen corresponding path program 85 times [2018-12-03 15:28:03,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:03,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:03,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:03,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:03,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:06,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:06,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:06,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:06,581 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:06,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:06,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:06,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:28:06,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:06,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:28:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:06,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:06,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:06,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:15,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:15,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 15:28:15,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:15,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 15:28:15,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 15:28:15,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 15:28:15,262 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 15:28:15,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:15,615 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 15:28:15,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 15:28:15,616 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 15:28:15,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:15,617 INFO L225 Difference]: With dead ends: 92 [2018-12-03 15:28:15,617 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 15:28:15,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 15:28:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 15:28:15,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 15:28:15,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 15:28:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 15:28:15,620 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 15:28:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:15,621 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 15:28:15,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 15:28:15,621 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 15:28:15,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 15:28:15,622 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:15,622 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 15:28:15,622 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:15,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:15,622 INFO L82 PathProgramCache]: Analyzing trace with hash 158476001, now seen corresponding path program 86 times [2018-12-03 15:28:15,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:15,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:15,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:15,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:18,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:18,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:18,331 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:18,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:18,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:18,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:28:18,341 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:28:18,341 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:28:18,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 15:28:18,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:28:18,413 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:18,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:27,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:27,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:27,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 15:28:27,262 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:27,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 15:28:27,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 15:28:27,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:28:27,264 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 15:28:27,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:27,498 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 15:28:27,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 15:28:27,498 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 15:28:27,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:27,499 INFO L225 Difference]: With dead ends: 93 [2018-12-03 15:28:27,499 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 15:28:27,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 15:28:27,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 15:28:27,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 15:28:27,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 15:28:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 15:28:27,502 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 15:28:27,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:27,502 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 15:28:27,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 15:28:27,502 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 15:28:27,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 15:28:27,503 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:27,503 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 15:28:27,503 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:27,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:27,503 INFO L82 PathProgramCache]: Analyzing trace with hash 617786760, now seen corresponding path program 87 times [2018-12-03 15:28:27,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:27,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:27,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:27,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:27,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:30,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:30,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:30,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:30,503 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:30,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:30,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:30,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:28:30,514 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:28:30,514 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:28:30,558 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:28:30,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:28:30,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:30,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:30,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:39,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:39,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 15:28:39,222 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:39,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 15:28:39,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 15:28:39,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 15:28:39,223 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 15:28:39,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:39,408 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 15:28:39,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 15:28:39,409 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 15:28:39,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:39,409 INFO L225 Difference]: With dead ends: 94 [2018-12-03 15:28:39,409 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 15:28:39,410 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 15:28:39,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 15:28:39,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 15:28:39,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 15:28:39,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 15:28:39,412 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 15:28:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:39,412 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 15:28:39,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 15:28:39,413 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 15:28:39,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 15:28:39,413 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:39,413 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 15:28:39,413 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:39,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:39,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1971518401, now seen corresponding path program 88 times [2018-12-03 15:28:39,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:39,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:39,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:28:39,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:39,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:42,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:42,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:42,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:42,227 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:42,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:42,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:42,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:28:42,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:42,237 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:28:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:42,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:42,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:42,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:28:51,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:51,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:28:51,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 15:28:51,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:28:51,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 15:28:51,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 15:28:51,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 15:28:51,426 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 15:28:51,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:28:51,632 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 15:28:51,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 15:28:51,632 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 15:28:51,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:28:51,633 INFO L225 Difference]: With dead ends: 95 [2018-12-03 15:28:51,634 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 15:28:51,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 15:28:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 15:28:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 15:28:51,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 15:28:51,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 15:28:51,638 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 15:28:51,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:28:51,638 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 15:28:51,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 15:28:51,638 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 15:28:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 15:28:51,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:28:51,638 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 15:28:51,639 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:28:51,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:28:51,639 INFO L82 PathProgramCache]: Analyzing trace with hash 987526312, now seen corresponding path program 89 times [2018-12-03 15:28:51,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:28:51,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:51,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:28:51,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:28:51,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:28:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:28:54,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:54,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:54,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:28:54,844 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:28:54,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:28:54,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:28:54,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:28:54,853 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:28:54,853 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:28:54,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 15:28:54,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:28:54,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:28:54,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:28:54,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:03,922 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:03,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:03,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 15:29:03,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:03,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 15:29:03,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 15:29:03,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:29:03,943 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 15:29:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:04,079 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 15:29:04,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 15:29:04,079 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 15:29:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:04,080 INFO L225 Difference]: With dead ends: 96 [2018-12-03 15:29:04,080 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 15:29:04,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 15:29:04,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 15:29:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 15:29:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 15:29:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 15:29:04,084 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 15:29:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:04,084 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 15:29:04,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 15:29:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 15:29:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 15:29:04,084 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:04,084 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 15:29:04,085 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:04,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash 548542625, now seen corresponding path program 90 times [2018-12-03 15:29:04,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:04,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:04,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:04,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:04,086 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:07,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:07,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:07,275 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:07,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:07,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:07,275 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:29:07,285 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:29:07,285 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:29:07,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:29:07,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:07,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:07,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:07,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:16,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:16,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 15:29:16,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:16,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 15:29:16,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 15:29:16,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 15:29:16,958 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 15:29:17,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:17,203 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 15:29:17,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 15:29:17,203 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 15:29:17,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:17,204 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:29:17,205 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 15:29:17,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 15:29:17,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 15:29:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 15:29:17,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 15:29:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 15:29:17,209 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 15:29:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:17,209 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 15:29:17,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 15:29:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 15:29:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 15:29:17,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:17,210 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 15:29:17,210 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:17,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:17,210 INFO L82 PathProgramCache]: Analyzing trace with hash -175049784, now seen corresponding path program 91 times [2018-12-03 15:29:17,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:17,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:17,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:17,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:17,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:20,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:20,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:20,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:20,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:20,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:20,499 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:29:20,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:29:20,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:29:20,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:20,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:20,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:30,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:30,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 15:29:30,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:30,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 15:29:30,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 15:29:30,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 15:29:30,048 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 15:29:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:30,271 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 15:29:30,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 15:29:30,271 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 15:29:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:30,271 INFO L225 Difference]: With dead ends: 98 [2018-12-03 15:29:30,271 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 15:29:30,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 15:29:30,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 15:29:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 15:29:30,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 15:29:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 15:29:30,274 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 15:29:30,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:30,274 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 15:29:30,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 15:29:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 15:29:30,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 15:29:30,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:30,275 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 15:29:30,275 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:30,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:30,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1131577983, now seen corresponding path program 92 times [2018-12-03 15:29:30,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:30,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:30,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:29:30,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:30,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:33,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:33,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:33,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:33,534 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:33,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:33,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:33,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:29:33,543 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:29:33,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:29:33,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 15:29:33,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:33,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:33,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:43,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:43,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 15:29:43,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:43,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 15:29:43,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 15:29:43,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:29:43,526 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 15:29:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:43,686 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 15:29:43,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 15:29:43,686 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 15:29:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:43,687 INFO L225 Difference]: With dead ends: 99 [2018-12-03 15:29:43,687 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 15:29:43,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 15:29:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 15:29:43,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 15:29:43,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 15:29:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 15:29:43,692 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 15:29:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:43,692 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 15:29:43,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 15:29:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 15:29:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 15:29:43,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:43,693 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 15:29:43,693 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:43,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:43,693 INFO L82 PathProgramCache]: Analyzing trace with hash -719181080, now seen corresponding path program 93 times [2018-12-03 15:29:43,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:43,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:43,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:43,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:43,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:29:46,880 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:46,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:46,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:29:46,881 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:29:46,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:29:46,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:29:46,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:29:46,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:29:46,898 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:29:46,947 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:29:46,947 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:29:46,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:29:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:46,974 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:29:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:29:57,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:29:57,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 15:29:57,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:29:57,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 15:29:57,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 15:29:57,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 15:29:57,130 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 15:29:57,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:29:57,270 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 15:29:57,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 15:29:57,271 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 15:29:57,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:29:57,271 INFO L225 Difference]: With dead ends: 100 [2018-12-03 15:29:57,272 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 15:29:57,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 15:29:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 15:29:57,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 15:29:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 15:29:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 15:29:57,276 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 15:29:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:29:57,276 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 15:29:57,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 15:29:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 15:29:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 15:29:57,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:29:57,277 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 15:29:57,277 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:29:57,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:29:57,278 INFO L82 PathProgramCache]: Analyzing trace with hash -819778975, now seen corresponding path program 94 times [2018-12-03 15:29:57,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:29:57,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:57,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:29:57,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:29:57,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:29:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:00,482 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:00,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:00,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:00,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:00,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:00,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:00,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:30:00,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:30:00,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:30:00,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:00,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:00,563 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:00,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:10,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:10,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:10,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 15:30:10,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:10,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 15:30:10,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 15:30:10,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 15:30:10,899 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 15:30:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:11,055 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 15:30:11,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 15:30:11,055 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 15:30:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:11,056 INFO L225 Difference]: With dead ends: 101 [2018-12-03 15:30:11,056 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 15:30:11,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 15:30:11,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 15:30:11,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 15:30:11,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 15:30:11,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 15:30:11,060 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 15:30:11,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:11,060 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 15:30:11,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 15:30:11,060 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 15:30:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 15:30:11,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:11,061 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 15:30:11,061 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:11,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:11,061 INFO L82 PathProgramCache]: Analyzing trace with hash 356653576, now seen corresponding path program 95 times [2018-12-03 15:30:11,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:11,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:30:11,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:11,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:14,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:14,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:14,543 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:14,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:14,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:14,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:30:14,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:30:14,553 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:30:14,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 15:30:14,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:30:14,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:14,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:25,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:25,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:25,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 15:30:25,367 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:25,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 15:30:25,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 15:30:25,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:30:25,369 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 15:30:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:25,538 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 15:30:25,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 15:30:25,540 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 15:30:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:25,540 INFO L225 Difference]: With dead ends: 102 [2018-12-03 15:30:25,540 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 15:30:25,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:30:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 15:30:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 15:30:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 15:30:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 15:30:25,544 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 15:30:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:25,544 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 15:30:25,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 15:30:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 15:30:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 15:30:25,545 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:25,545 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 15:30:25,545 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:25,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:25,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1828643007, now seen corresponding path program 96 times [2018-12-03 15:30:25,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:25,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:25,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:30:25,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:25,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:29,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:29,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:29,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:29,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:29,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:29,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:30:29,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:30:29,180 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:30:29,242 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:30:29,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:30:29,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:29,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:40,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:40,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:40,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 15:30:40,134 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:40,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 15:30:40,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 15:30:40,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 15:30:40,136 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 15:30:40,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:40,359 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 15:30:40,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 15:30:40,359 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 15:30:40,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:40,360 INFO L225 Difference]: With dead ends: 103 [2018-12-03 15:30:40,360 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 15:30:40,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 15:30:40,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 15:30:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 15:30:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 15:30:40,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 15:30:40,365 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 15:30:40,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:40,366 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 15:30:40,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 15:30:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 15:30:40,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 15:30:40,366 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:40,367 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 15:30:40,367 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:40,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:40,367 INFO L82 PathProgramCache]: Analyzing trace with hash -853360344, now seen corresponding path program 97 times [2018-12-03 15:30:40,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:40,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:40,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:30:40,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:40,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:44,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:44,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:44,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:44,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:44,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:44,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:30:44,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:30:44,015 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:30:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:44,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:44,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:44,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:30:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:55,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:30:55,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 15:30:55,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:30:55,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 15:30:55,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 15:30:55,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 15:30:55,049 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 15:30:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:30:55,344 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 15:30:55,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 15:30:55,344 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 15:30:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:30:55,345 INFO L225 Difference]: With dead ends: 104 [2018-12-03 15:30:55,345 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 15:30:55,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 15:30:55,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 15:30:55,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 15:30:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 15:30:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 15:30:55,349 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 15:30:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:30:55,349 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 15:30:55,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 15:30:55,349 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 15:30:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 15:30:55,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:30:55,349 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 15:30:55,350 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:30:55,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:30:55,350 INFO L82 PathProgramCache]: Analyzing trace with hash -684368863, now seen corresponding path program 98 times [2018-12-03 15:30:55,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:30:55,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:55,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:30:55,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:30:55,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:30:55,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:30:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:59,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:59,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:30:59,179 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:30:59,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:30:59,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:30:59,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:30:59,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:30:59,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:30:59,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 15:30:59,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:30:59,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:30:59,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:30:59,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:31:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:31:10,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:31:10,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 15:31:10,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:31:10,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 15:31:10,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 15:31:10,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 15:31:10,530 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 15:31:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:31:10,760 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 15:31:10,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 15:31:10,761 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 15:31:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:31:10,761 INFO L225 Difference]: With dead ends: 105 [2018-12-03 15:31:10,761 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 15:31:10,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 15:31:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 15:31:10,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 15:31:10,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 15:31:10,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 15:31:10,765 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 15:31:10,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:31:10,765 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 15:31:10,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 15:31:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 15:31:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 15:31:10,766 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:31:10,766 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 15:31:10,766 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:31:10,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:31:10,766 INFO L82 PathProgramCache]: Analyzing trace with hash 259399752, now seen corresponding path program 99 times [2018-12-03 15:31:10,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:31:10,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:10,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:31:10,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:10,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:31:10,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:14,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:31:14,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:14,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:31:14,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:31:14,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:31:14,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:14,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:31:14,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:31:14,654 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:31:14,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:31:14,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:31:14,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:31:14,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:31:14,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:31:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:31:26,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:31:26,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 15:31:26,249 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:31:26,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 15:31:26,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 15:31:26,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 15:31:26,252 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 15:31:26,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:31:26,504 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 15:31:26,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 15:31:26,505 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 15:31:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:31:26,506 INFO L225 Difference]: With dead ends: 106 [2018-12-03 15:31:26,506 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 15:31:26,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 15:31:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 15:31:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 15:31:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 15:31:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 15:31:26,510 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 15:31:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:31:26,511 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 15:31:26,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 15:31:26,511 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 15:31:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 15:31:26,511 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:31:26,511 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 15:31:26,511 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:31:26,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:31:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash -548544255, now seen corresponding path program 100 times [2018-12-03 15:31:26,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:31:26,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:26,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:31:26,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:26,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:31:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:30,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:31:30,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:30,362 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:31:30,362 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:31:30,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:31:30,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:30,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:31:30,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:31:30,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:31:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:30,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:31:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:31:30,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:31:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:31:42,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:31:42,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 15:31:42,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:31:42,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 15:31:42,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 15:31:42,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 15:31:42,198 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 15:31:42,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:31:42,357 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 15:31:42,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 15:31:42,358 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 15:31:42,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:31:42,359 INFO L225 Difference]: With dead ends: 107 [2018-12-03 15:31:42,359 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 15:31:42,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 15:31:42,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 15:31:42,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 15:31:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 15:31:42,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 15:31:42,364 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 15:31:42,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:31:42,364 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 15:31:42,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 15:31:42,364 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 15:31:42,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 15:31:42,365 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:31:42,365 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 15:31:42,365 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:31:42,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:31:42,366 INFO L82 PathProgramCache]: Analyzing trace with hash 174995304, now seen corresponding path program 101 times [2018-12-03 15:31:42,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:31:42,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:42,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:31:42,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:42,367 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:31:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:31:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:31:46,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:46,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:31:46,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:31:46,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:31:46,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:31:46,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:31:46,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:31:46,256 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:31:46,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 15:31:46,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:31:46,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:31:46,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:31:46,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:31:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:31:58,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:31:58,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 15:31:58,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:31:58,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 15:31:58,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 15:31:58,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 15:31:58,237 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 15:31:58,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:31:58,548 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 15:31:58,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 15:31:58,549 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 15:31:58,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:31:58,550 INFO L225 Difference]: With dead ends: 108 [2018-12-03 15:31:58,550 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 15:31:58,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 15:31:58,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 15:31:58,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 15:31:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 15:31:58,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 15:31:58,554 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 15:31:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:31:58,555 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 15:31:58,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 15:31:58,555 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 15:31:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 15:31:58,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:31:58,555 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 15:31:58,556 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:31:58,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:31:58,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1129885153, now seen corresponding path program 102 times [2018-12-03 15:31:58,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:31:58,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:58,557 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:31:58,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:31:58,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:31:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:02,633 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:02,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:02,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:02,634 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:02,634 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:02,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:02,634 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:32:02,642 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:32:02,643 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:32:02,696 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:32:02,697 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:32:02,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:02,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:32:15,059 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:15,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:15,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 15:32:15,080 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:15,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 15:32:15,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 15:32:15,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 15:32:15,083 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 15:32:15,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:15,390 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 15:32:15,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 15:32:15,404 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 15:32:15,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:15,405 INFO L225 Difference]: With dead ends: 109 [2018-12-03 15:32:15,405 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 15:32:15,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 15:32:15,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 15:32:15,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 15:32:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 15:32:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 15:32:15,410 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 15:32:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:15,411 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 15:32:15,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 15:32:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 15:32:15,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 15:32:15,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:15,412 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 15:32:15,412 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:15,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:15,412 INFO L82 PathProgramCache]: Analyzing trace with hash 666699400, now seen corresponding path program 103 times [2018-12-03 15:32:15,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:15,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:15,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:32:15,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:15,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:19,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:19,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:19,216 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:19,216 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:19,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:19,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:19,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:32:19,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:32:19,224 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:32:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:19,279 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:19,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:32:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:31,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:31,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 15:32:31,675 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:31,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 15:32:31,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 15:32:31,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 15:32:31,677 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 15:32:31,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:31,914 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 15:32:31,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 15:32:31,915 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 15:32:31,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:31,915 INFO L225 Difference]: With dead ends: 110 [2018-12-03 15:32:31,916 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 15:32:31,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 15:32:31,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 15:32:31,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 15:32:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:32:31,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 15:32:31,920 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 15:32:31,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:31,920 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 15:32:31,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 15:32:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 15:32:31,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 15:32:31,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:31,921 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 15:32:31,921 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:31,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:31,922 INFO L82 PathProgramCache]: Analyzing trace with hash -807157055, now seen corresponding path program 104 times [2018-12-03 15:32:31,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:31,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:31,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:32:31,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:31,922 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:31,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:36,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:36,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:36,208 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:36,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:36,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:36,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:32:36,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:32:36,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:32:36,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 15:32:36,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:32:36,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:36,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:32:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:48,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:32:48,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 15:32:48,860 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:32:48,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 15:32:48,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 15:32:48,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 15:32:48,862 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 15:32:49,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:32:49,085 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 15:32:49,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 15:32:49,086 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 15:32:49,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:32:49,086 INFO L225 Difference]: With dead ends: 111 [2018-12-03 15:32:49,086 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 15:32:49,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 15:32:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 15:32:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 15:32:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 15:32:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 15:32:49,090 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 15:32:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:32:49,090 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 15:32:49,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 15:32:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 15:32:49,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 15:32:49,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:32:49,091 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 15:32:49,092 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:32:49,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:32:49,092 INFO L82 PathProgramCache]: Analyzing trace with hash 747933096, now seen corresponding path program 105 times [2018-12-03 15:32:49,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:32:49,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:49,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:32:49,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:32:49,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:32:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:32:53,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:53,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:53,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:32:53,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:32:53,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:32:53,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:32:53,289 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:32:53,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:32:53,296 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:32:53,350 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:32:53,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:32:53,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:32:53,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:32:53,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:06,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:06,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 15:33:06,466 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:06,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 15:33:06,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 15:33:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 15:33:06,468 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 15:33:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:06,715 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 15:33:06,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 15:33:06,716 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 15:33:06,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:06,717 INFO L225 Difference]: With dead ends: 112 [2018-12-03 15:33:06,717 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 15:33:06,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 15:33:06,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 15:33:06,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 15:33:06,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 15:33:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 15:33:06,722 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 15:33:06,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:06,722 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 15:33:06,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 15:33:06,722 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 15:33:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 15:33:06,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:06,723 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 15:33:06,723 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:06,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:06,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1711087521, now seen corresponding path program 106 times [2018-12-03 15:33:06,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:06,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:06,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:06,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:06,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:11,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:11,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:11,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:11,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:11,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:11,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:11,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:33:11,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:11,145 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:33:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:11,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:11,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:24,123 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:24,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:24,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 15:33:24,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:24,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 15:33:24,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 15:33:24,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 15:33:24,146 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 15:33:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:24,410 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 15:33:24,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 15:33:24,410 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 15:33:24,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:24,411 INFO L225 Difference]: With dead ends: 113 [2018-12-03 15:33:24,411 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 15:33:24,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 15:33:24,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 15:33:24,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 15:33:24,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 15:33:24,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 15:33:24,415 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 15:33:24,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:24,416 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 15:33:24,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 15:33:24,416 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 15:33:24,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 15:33:24,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:24,416 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 15:33:24,417 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:24,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:24,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1504103624, now seen corresponding path program 107 times [2018-12-03 15:33:24,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:24,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:24,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:33:24,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:24,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:28,786 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:28,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:28,786 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:28,787 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:28,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:28,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:28,787 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:33:28,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:33:28,796 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:33:28,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 15:33:28,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:28,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:28,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:33:42,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:42,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:33:42,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 15:33:42,238 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:33:42,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 15:33:42,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 15:33:42,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 15:33:42,241 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 15:33:42,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:33:42,578 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 15:33:42,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 15:33:42,578 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 15:33:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:33:42,579 INFO L225 Difference]: With dead ends: 114 [2018-12-03 15:33:42,579 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 15:33:42,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 15:33:42,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 15:33:42,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 15:33:42,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:33:42,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 15:33:42,583 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 15:33:42,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:33:42,584 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 15:33:42,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 15:33:42,584 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 15:33:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:33:42,584 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:33:42,584 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 15:33:42,584 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:33:42,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:33:42,585 INFO L82 PathProgramCache]: Analyzing trace with hash -617429887, now seen corresponding path program 108 times [2018-12-03 15:33:42,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:33:42,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:42,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:33:42,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:33:42,586 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:33:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:33:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:46,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:46,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:33:46,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:33:46,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:33:46,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:33:46,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:33:46,988 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:33:46,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:33:47,045 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:33:47,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:33:47,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:33:47,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:33:47,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:00,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:00,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 15:34:00,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:00,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 15:34:00,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 15:34:00,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 15:34:00,433 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 15:34:00,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:00,701 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 15:34:00,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 15:34:00,708 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 15:34:00,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:00,709 INFO L225 Difference]: With dead ends: 115 [2018-12-03 15:34:00,709 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 15:34:00,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 15:34:00,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 15:34:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 15:34:00,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 15:34:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 15:34:00,713 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 15:34:00,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:00,713 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 15:34:00,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 15:34:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 15:34:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 15:34:00,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:00,714 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 15:34:00,714 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:00,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1960459288, now seen corresponding path program 109 times [2018-12-03 15:34:00,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:00,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:00,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:34:00,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:00,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:05,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:05,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:05,259 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:05,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:05,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:05,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:34:05,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:05,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:34:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:05,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:05,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:34:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:19,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:34:19,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 15:34:19,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:34:19,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 15:34:19,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 15:34:19,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 15:34:19,018 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 15:34:19,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:34:19,260 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 15:34:19,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 15:34:19,261 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 15:34:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:34:19,261 INFO L225 Difference]: With dead ends: 116 [2018-12-03 15:34:19,261 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 15:34:19,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 15:34:19,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 15:34:19,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 15:34:19,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 15:34:19,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 15:34:19,266 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 15:34:19,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:34:19,266 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 15:34:19,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 15:34:19,266 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 15:34:19,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 15:34:19,267 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:34:19,267 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 15:34:19,267 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:34:19,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:34:19,267 INFO L82 PathProgramCache]: Analyzing trace with hash -644697759, now seen corresponding path program 110 times [2018-12-03 15:34:19,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:34:19,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:19,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:34:19,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:34:19,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:34:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:34:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:23,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:23,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:34:23,902 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:34:23,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:34:23,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:34:23,902 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2018-12-03 15:34:23,910 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:34:23,910 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:34:24,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 15:34:24,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:34:24,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:34:24,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:34:24,030 INFO L316 TraceCheckSpWp]: Computing backward predicates...