java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:24:18,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:24:18,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:24:18,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:24:18,035 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:24:18,036 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:24:18,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:24:18,040 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:24:18,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:24:18,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:24:18,043 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:24:18,043 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:24:18,044 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:24:18,045 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:24:18,046 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:24:18,047 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:24:18,048 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:24:18,050 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:24:18,052 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:24:18,053 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:24:18,054 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:24:18,057 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:24:18,060 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:24:18,060 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:24:18,060 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:24:18,061 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:24:18,064 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:24:18,065 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:24:18,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:24:18,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:24:18,068 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:24:18,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:24:18,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:24:18,069 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:24:18,070 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:24:18,070 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:24:18,071 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:24:18,087 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:24:18,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:24:18,088 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:24:18,089 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:24:18,089 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:24:18,089 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:24:18,089 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:24:18,089 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:24:18,090 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:24:18,092 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:24:18,092 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:24:18,093 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:24:18,093 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:24:18,093 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:24:18,093 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:24:18,094 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:24:18,094 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:24:18,094 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:24:18,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:24:18,095 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:24:18,095 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:24:18,095 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:24:18,095 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:24:18,095 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:24:18,097 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:24:18,098 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:24:18,098 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:24:18,098 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:24:18,098 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:24:18,099 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:24:18,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:24:18,099 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:24:18,099 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:24:18,100 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:24:18,100 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:24:18,100 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:24:18,100 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:24:18,100 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:24:18,101 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:24:18,101 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:24:18,101 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:24:18,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:24:18,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:24:18,177 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:24:18,179 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:24:18,179 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:24:18,180 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 16:24:18,180 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/down.i_4.bplTransformedIcfg_BEv2_5.bpl' [2018-12-03 16:24:18,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:24:18,233 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:24:18,234 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:24:18,234 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:24:18,234 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:24:18,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:18" (1/1) ... [2018-12-03 16:24:18,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:18" (1/1) ... [2018-12-03 16:24:18,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:24:18,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:24:18,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:24:18,275 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:24:18,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:18" (1/1) ... [2018-12-03 16:24:18,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:18" (1/1) ... [2018-12-03 16:24:18,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:18" (1/1) ... [2018-12-03 16:24:18,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:18" (1/1) ... [2018-12-03 16:24:18,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:18" (1/1) ... [2018-12-03 16:24:18,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:18" (1/1) ... [2018-12-03 16:24:18,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:18" (1/1) ... [2018-12-03 16:24:18,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:24:18,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:24:18,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:24:18,301 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:24:18,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:24:18,377 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 16:24:18,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 16:24:18,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 16:24:18,715 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 16:24:18,715 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:24:18,716 INFO L202 PluginConnector]: Adding new model down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:24:18 BoogieIcfgContainer [2018-12-03 16:24:18,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:24:18,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:24:18,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:24:18,723 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:24:18,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:24:18" (1/2) ... [2018-12-03 16:24:18,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32381911 and model type down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:24:18, skipping insertion in model container [2018-12-03 16:24:18,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down.i_4.bplTransformedIcfg_BEv2_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:24:18" (2/2) ... [2018-12-03 16:24:18,728 INFO L112 eAbstractionObserver]: Analyzing ICFG down.i_4.bplTransformedIcfg_BEv2_5.bpl [2018-12-03 16:24:18,738 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:24:18,748 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:24:18,768 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:24:18,804 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:24:18,804 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:24:18,804 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:24:18,804 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:24:18,805 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:24:18,805 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:24:18,805 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:24:18,805 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:24:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2018-12-03 16:24:18,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:24:18,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:18,829 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:18,831 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:18,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:18,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1951930377, now seen corresponding path program 1 times [2018-12-03 16:24:18,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:18,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:18,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:18,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:18,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:19,001 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 16:24:19,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:24:19,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:24:19,004 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:24:19,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:24:19,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:24:19,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:24:19,030 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 3 states. [2018-12-03 16:24:19,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:19,160 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2018-12-03 16:24:19,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:24:19,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-03 16:24:19,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:19,173 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:24:19,173 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:24:19,178 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 16:24:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:24:19,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-03 16:24:19,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:24:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2018-12-03 16:24:19,212 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 7 [2018-12-03 16:24:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:19,212 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2018-12-03 16:24:19,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:24:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2018-12-03 16:24:19,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:24:19,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:19,214 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:19,214 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:19,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:19,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1951989959, now seen corresponding path program 1 times [2018-12-03 16:24:19,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:19,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:19,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:19,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:19,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:19,288 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 16:24:19,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:24:19,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:24:19,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:24:19,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:24:19,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:24:19,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:24:19,291 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 4 states. [2018-12-03 16:24:19,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:19,398 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-12-03 16:24:19,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:24:19,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 16:24:19,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:19,400 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:24:19,400 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:24:19,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:24:19,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:24:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:24:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:24:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-12-03 16:24:19,406 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 7 [2018-12-03 16:24:19,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:19,406 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-12-03 16:24:19,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:24:19,406 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2018-12-03 16:24:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:24:19,407 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:19,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:19,407 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:19,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:19,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1455783312, now seen corresponding path program 1 times [2018-12-03 16:24:19,408 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:19,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:19,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:19,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:19,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:19,468 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 16:24:19,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:24:19,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 16:24:19,469 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:24:19,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:24:19,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:24:19,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:24:19,471 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand 4 states. [2018-12-03 16:24:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:19,599 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-03 16:24:19,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:24:19,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 16:24:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:19,601 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:24:19,601 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:24:19,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:24:19,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:24:19,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-12-03 16:24:19,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:24:19,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-03 16:24:19,608 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2018-12-03 16:24:19,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:19,608 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-03 16:24:19,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:24:19,609 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-03 16:24:19,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:24:19,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:19,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:19,610 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:19,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:19,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1455723730, now seen corresponding path program 1 times [2018-12-03 16:24:19,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:19,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:19,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:19,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:19,612 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:19,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:19,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:19,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:24:19,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 16:24:19,675 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:24:19,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:24:19,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:24:19,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:24:19,676 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 4 states. [2018-12-03 16:24:19,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:19,717 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-12-03 16:24:19,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:24:19,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 16:24:19,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:19,719 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:24:19,719 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:24:19,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 16:24:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:24:19,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2018-12-03 16:24:19,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:24:19,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-12-03 16:24:19,725 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 8 [2018-12-03 16:24:19,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:19,726 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-03 16:24:19,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:24:19,726 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-12-03 16:24:19,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:24:19,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:19,727 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:19,727 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:19,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:19,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1394403420, now seen corresponding path program 1 times [2018-12-03 16:24:19,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:19,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:19,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:19,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:19,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:19,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:19,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:19,844 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-12-03 16:24:19,846 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9], [13], [15], [17], [21], [23], [25] [2018-12-03 16:24:19,887 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:24:19,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:24:20,193 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:24:20,194 INFO L272 AbstractInterpreter]: Visited 10 different actions 39 times. Merged at 8 different actions 21 times. Widened at 1 different actions 1 times. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:24:20,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:20,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:24:20,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:20,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 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 16:24:20,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:20,265 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:20,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:20,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:20,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:20,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:20,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 16:24:20,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:20,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:24:20,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:24:20,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:24:20,469 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 6 states. [2018-12-03 16:24:20,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:20,781 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-03 16:24:20,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:24:20,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-12-03 16:24:20,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:20,783 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:24:20,783 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:24:20,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:24:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:24:20,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:24:20,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:24:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 16:24:20,789 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2018-12-03 16:24:20,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:20,790 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 16:24:20,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:24:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 16:24:20,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:24:20,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:20,791 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 16:24:20,792 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:20,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:20,794 INFO L82 PathProgramCache]: Analyzing trace with hash -961145443, now seen corresponding path program 2 times [2018-12-03 16:24:20,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:20,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:20,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:20,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:20,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:20,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:20,918 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:20,918 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:20,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:20,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:20,919 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 16:24:20,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:20,937 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:20,968 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:24:20,968 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:20,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:20,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:21,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:21,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-12-03 16:24:21,069 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:21,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:24:21,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:24:21,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:24:21,070 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 5 states. [2018-12-03 16:24:21,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:21,231 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-12-03 16:24:21,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:24:21,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-12-03 16:24:21,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:21,233 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:24:21,233 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:24:21,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-03 16:24:21,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:24:21,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2018-12-03 16:24:21,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:24:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-03 16:24:21,243 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-12-03 16:24:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:21,243 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-03 16:24:21,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:24:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-03 16:24:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:24:21,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:21,244 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:24:21,244 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:21,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:21,245 INFO L82 PathProgramCache]: Analyzing trace with hash -552275309, now seen corresponding path program 3 times [2018-12-03 16:24:21,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:21,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:21,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:21,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:21,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:21,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:21,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:21,371 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:21,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:21,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:21,371 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 16:24:21,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:21,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:21,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:21,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:21,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:21,405 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:21,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:21,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:21,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:24:21,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:21,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:24:21,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:24:21,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:24:21,461 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 8 states. [2018-12-03 16:24:21,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:21,817 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2018-12-03 16:24:21,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:24:21,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-03 16:24:21,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:21,818 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:24:21,818 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:24:21,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:24:21,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:24:21,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:24:21,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:24:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-03 16:24:21,824 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2018-12-03 16:24:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:21,825 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-03 16:24:21,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:24:21,825 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-03 16:24:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:24:21,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:21,826 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 16:24:21,826 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:21,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2071906362, now seen corresponding path program 4 times [2018-12-03 16:24:21,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:21,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:21,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:21,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:21,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:21,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:21,912 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:21,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:21,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:21,913 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:21,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:21,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:21,914 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 16:24:21,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:21,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:21,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:21,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:22,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:22,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2018-12-03 16:24:22,159 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:22,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:24:22,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:24:22,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:24:22,160 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2018-12-03 16:24:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:22,266 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2018-12-03 16:24:22,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:24:22,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-03 16:24:22,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:22,268 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:24:22,268 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:24:22,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:24:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:24:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2018-12-03 16:24:22,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:24:22,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-03 16:24:22,275 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2018-12-03 16:24:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:22,276 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-03 16:24:22,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:24:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-03 16:24:22,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:24:22,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:22,277 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:22,277 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:22,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:22,278 INFO L82 PathProgramCache]: Analyzing trace with hash -992407888, now seen corresponding path program 5 times [2018-12-03 16:24:22,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:22,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:22,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:22,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:22,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:22,442 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:22,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:22,443 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:22,443 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:22,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:22,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:22,444 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 16:24:22,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:22,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:22,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:24:22,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:22,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:22,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:22,611 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:22,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:22,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-12-03 16:24:22,633 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:22,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:24:22,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:24:22,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:24:22,634 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 10 states. [2018-12-03 16:24:22,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:22,835 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2018-12-03 16:24:22,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:24:22,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-03 16:24:22,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:22,836 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:24:22,837 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:24:22,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:24:22,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:24:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:24:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:24:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 16:24:22,843 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2018-12-03 16:24:22,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:22,844 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 16:24:22,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:24:22,844 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 16:24:22,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:24:22,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:22,845 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 16:24:22,845 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:22,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:22,845 INFO L82 PathProgramCache]: Analyzing trace with hash 390441321, now seen corresponding path program 6 times [2018-12-03 16:24:22,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:22,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:22,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:22,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:22,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:22,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:22,951 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:22,951 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:22,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:22,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:22,951 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 16:24:22,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:22,962 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:22,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:22,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:22,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:22,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:23,085 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:23,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:23,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-03 16:24:23,106 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:23,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:24:23,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:24:23,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:24:23,107 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 7 states. [2018-12-03 16:24:23,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:23,208 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-12-03 16:24:23,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:24:23,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-03 16:24:23,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:23,209 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:24:23,209 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:24:23,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 8 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:24:23,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:24:23,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2018-12-03 16:24:23,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:24:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-03 16:24:23,217 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2018-12-03 16:24:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:23,217 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-03 16:24:23,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:24:23,217 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-12-03 16:24:23,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:24:23,218 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:23,218 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2018-12-03 16:24:23,218 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:23,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:23,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1927135327, now seen corresponding path program 7 times [2018-12-03 16:24:23,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:23,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:23,220 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:23,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:23,220 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:23,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:23,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:23,463 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:23,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:23,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:23,464 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 16:24:23,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:23,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:23,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:23,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:23,693 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:23,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:23,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2018-12-03 16:24:23,714 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:23,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:24:23,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:24:23,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:24:23,715 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 12 states. [2018-12-03 16:24:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:23,906 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-12-03 16:24:23,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:24:23,907 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-12-03 16:24:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:23,907 INFO L225 Difference]: With dead ends: 58 [2018-12-03 16:24:23,907 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:24:23,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:24:23,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:24:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:24:23,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:24:23,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-03 16:24:23,914 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2018-12-03 16:24:23,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:23,914 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-03 16:24:23,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:24:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-03 16:24:23,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:24:23,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:23,915 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1] [2018-12-03 16:24:23,916 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:23,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:23,916 INFO L82 PathProgramCache]: Analyzing trace with hash -906890938, now seen corresponding path program 8 times [2018-12-03 16:24:23,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:23,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:23,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:23,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:23,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:24,007 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:24,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:24,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:24,009 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:24,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:24,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:24,010 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 16:24:24,019 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:24,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:24,035 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:24:24,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:24,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:24,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:24,194 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 23 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:24,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:24,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2018-12-03 16:24:24,216 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:24,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:24:24,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:24:24,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:24:24,217 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 8 states. [2018-12-03 16:24:24,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:24,544 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-12-03 16:24:24,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:24:24,544 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-12-03 16:24:24,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:24,545 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:24:24,545 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 16:24:24,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 10 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:24:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 16:24:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-12-03 16:24:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:24:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-12-03 16:24:24,558 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 28 [2018-12-03 16:24:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:24,559 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-12-03 16:24:24,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:24:24,559 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-12-03 16:24:24,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:24:24,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:24,562 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2018-12-03 16:24:24,562 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:24,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:24,564 INFO L82 PathProgramCache]: Analyzing trace with hash -466038340, now seen corresponding path program 9 times [2018-12-03 16:24:24,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:24,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:24,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:24,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:24,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:24,820 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:24,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:24,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:24,821 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:24,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:24,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:24,821 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 16:24:24,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:24,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:24,848 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:24,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:24,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:24,859 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:24,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:25,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:25,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2018-12-03 16:24:25,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:25,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:24:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:24:25,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:24:25,148 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 14 states. [2018-12-03 16:24:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:25,644 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-12-03 16:24:25,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:24:25,644 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-12-03 16:24:25,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:25,645 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:24:25,645 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:24:25,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 52 SyntacticMatches, 11 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:24:25,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:24:25,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:24:25,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:24:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-03 16:24:25,653 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 32 [2018-12-03 16:24:25,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:25,654 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-03 16:24:25,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:24:25,654 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-03 16:24:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:24:25,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:25,655 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1] [2018-12-03 16:24:25,655 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:25,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:25,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1282545973, now seen corresponding path program 10 times [2018-12-03 16:24:25,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:25,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:25,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:25,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:25,657 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:25,981 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:25,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:25,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:25,982 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:25,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:25,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:25,982 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 16:24:25,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:25,992 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:26,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:26,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:26,447 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 31 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:26,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:26,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-03 16:24:26,468 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:26,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:24:26,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:24:26,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:24:26,469 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 9 states. [2018-12-03 16:24:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:26,526 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-12-03 16:24:26,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:24:26,526 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-12-03 16:24:26,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:26,527 INFO L225 Difference]: With dead ends: 50 [2018-12-03 16:24:26,527 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:24:26,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 12 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:24:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:24:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-12-03 16:24:26,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:24:26,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-12-03 16:24:26,534 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2018-12-03 16:24:26,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:26,535 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-12-03 16:24:26,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:24:26,535 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-12-03 16:24:26,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 16:24:26,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:26,536 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2018-12-03 16:24:26,536 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:26,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:26,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1500867115, now seen corresponding path program 11 times [2018-12-03 16:24:26,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:26,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:26,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:26,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:26,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:26,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:26,701 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 84 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:26,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:26,702 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:26,702 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:26,702 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:26,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:26,702 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 16:24:26,710 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:26,711 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:26,741 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:24:26,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:26,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:26,752 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 84 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:26,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:26,960 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 84 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:26,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:26,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2018-12-03 16:24:26,980 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:26,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:24:26,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:24:26,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:24:26,981 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 16 states. [2018-12-03 16:24:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:27,302 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2018-12-03 16:24:27,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:24:27,302 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2018-12-03 16:24:27,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:27,304 INFO L225 Difference]: With dead ends: 76 [2018-12-03 16:24:27,304 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:24:27,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 13 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:24:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:24:27,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 16:24:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 16:24:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-12-03 16:24:27,312 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 37 [2018-12-03 16:24:27,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:27,312 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-12-03 16:24:27,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:24:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-12-03 16:24:27,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:24:27,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:27,314 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1] [2018-12-03 16:24:27,314 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:27,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:27,314 INFO L82 PathProgramCache]: Analyzing trace with hash 594208338, now seen corresponding path program 12 times [2018-12-03 16:24:27,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:27,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:27,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:27,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:27,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 40 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:27,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:27,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:27,616 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:27,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 16:24:27,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:27,616 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 16:24:27,625 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:27,625 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:27,674 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:27,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:27,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 40 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:27,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 40 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:27,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:27,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-12-03 16:24:27,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:27,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:24:27,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:24:27,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:24:27,908 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 10 states. [2018-12-03 16:24:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:27,972 INFO L93 Difference]: Finished difference Result 55 states and 58 transitions. [2018-12-03 16:24:27,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:24:27,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-12-03 16:24:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:27,973 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:24:27,974 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:24:27,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 67 SyntacticMatches, 14 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:24:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:24:27,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-12-03 16:24:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:24:27,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-03 16:24:27,983 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 38 [2018-12-03 16:24:27,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:27,983 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-03 16:24:27,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:24:27,983 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-03 16:24:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:24:27,984 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:27,984 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2018-12-03 16:24:27,984 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:27,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:27,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1054367944, now seen corresponding path program 13 times [2018-12-03 16:24:27,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:27,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:27,986 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:27,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:27,986 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 112 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:28,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:28,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:28,184 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:28,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:28,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:28,185 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 16:24:28,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:28,199 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:28,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 112 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:28,248 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:28,418 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 112 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:28,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:28,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2018-12-03 16:24:28,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:28,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:24:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:24:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:24:28,441 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 18 states. [2018-12-03 16:24:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:28,648 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2018-12-03 16:24:28,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:24:28,649 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 42 [2018-12-03 16:24:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:28,649 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:24:28,649 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 16:24:28,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 68 SyntacticMatches, 15 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:24:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 16:24:28,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 16:24:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 16:24:28,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2018-12-03 16:24:28,658 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 42 [2018-12-03 16:24:28,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:28,659 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2018-12-03 16:24:28,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:24:28,659 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2018-12-03 16:24:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:24:28,660 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:28,660 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1] [2018-12-03 16:24:28,660 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:28,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:28,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1098736897, now seen corresponding path program 14 times [2018-12-03 16:24:28,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:28,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:28,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:28,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:28,662 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 50 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:28,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:28,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:28,885 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:28,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:28,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:28,886 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 16:24:28,896 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:28,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:28,945 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:24:28,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:28,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:28,957 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 50 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:28,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:29,173 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 50 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:29,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:29,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2018-12-03 16:24:29,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:29,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:24:29,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:24:29,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:24:29,193 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 11 states. [2018-12-03 16:24:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:29,296 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-12-03 16:24:29,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:24:29,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2018-12-03 16:24:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:29,297 INFO L225 Difference]: With dead ends: 60 [2018-12-03 16:24:29,297 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 16:24:29,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 76 SyntacticMatches, 16 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:24:29,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 16:24:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2018-12-03 16:24:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 16:24:29,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-12-03 16:24:29,307 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 43 [2018-12-03 16:24:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:29,307 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-12-03 16:24:29,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:24:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-12-03 16:24:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:24:29,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:29,308 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2018-12-03 16:24:29,309 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:29,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:29,309 INFO L82 PathProgramCache]: Analyzing trace with hash -48369673, now seen corresponding path program 15 times [2018-12-03 16:24:29,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:29,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:29,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:29,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:29,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:29,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 144 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:29,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:29,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:29,595 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:29,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:29,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:29,595 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 16:24:29,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:29,604 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:29,637 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:29,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:29,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 144 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:29,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:30,823 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 144 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:30,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:30,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2018-12-03 16:24:30,842 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:30,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:24:30,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:24:30,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:24:30,843 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 20 states. [2018-12-03 16:24:31,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:31,073 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2018-12-03 16:24:31,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:24:31,073 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-12-03 16:24:31,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:31,074 INFO L225 Difference]: With dead ends: 94 [2018-12-03 16:24:31,074 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:24:31,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 17 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:24:31,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:24:31,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 16:24:31,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:24:31,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-12-03 16:24:31,082 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 47 [2018-12-03 16:24:31,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:31,082 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-12-03 16:24:31,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:24:31,082 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-12-03 16:24:31,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:24:31,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:31,083 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1] [2018-12-03 16:24:31,083 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:31,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:31,084 INFO L82 PathProgramCache]: Analyzing trace with hash 239052638, now seen corresponding path program 16 times [2018-12-03 16:24:31,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:31,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:31,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:31,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:31,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 61 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:32,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:32,533 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:32,533 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:32,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:32,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:32,534 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 16:24:32,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:32,548 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:32,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:32,593 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 61 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:32,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 61 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:32,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:32,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 11 [2018-12-03 16:24:32,969 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:32,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:24:32,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:24:32,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:24:32,970 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 12 states. [2018-12-03 16:24:33,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:33,100 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-12-03 16:24:33,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:24:33,101 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-12-03 16:24:33,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:33,102 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:24:33,102 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 16:24:33,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 85 SyntacticMatches, 18 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:24:33,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 16:24:33,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2018-12-03 16:24:33,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:24:33,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-12-03 16:24:33,109 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 48 [2018-12-03 16:24:33,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:33,110 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-12-03 16:24:33,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:24:33,110 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-12-03 16:24:33,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:24:33,111 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:33,111 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2018-12-03 16:24:33,111 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:33,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:33,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1074641876, now seen corresponding path program 17 times [2018-12-03 16:24:33,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:33,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:33,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:33,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:33,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 180 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:33,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:33,349 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:33,349 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:33,349 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:33,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:33,349 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 16:24:33,359 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:33,359 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:33,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:24:33,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:33,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:33,402 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 180 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:33,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 180 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:33,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:33,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2018-12-03 16:24:33,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:33,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:24:33,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:24:33,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:24:33,609 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 22 states. [2018-12-03 16:24:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:33,984 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2018-12-03 16:24:33,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:24:33,984 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 52 [2018-12-03 16:24:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:33,985 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:24:33,985 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 16:24:33,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 84 SyntacticMatches, 19 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=731, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:24:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 16:24:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 16:24:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 16:24:33,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-03 16:24:33,992 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 52 [2018-12-03 16:24:33,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:33,993 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-03 16:24:33,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:24:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-03 16:24:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 16:24:33,993 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:33,994 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1, 1, 1] [2018-12-03 16:24:33,994 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:33,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:33,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1305899827, now seen corresponding path program 18 times [2018-12-03 16:24:33,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:33,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:33,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:33,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:33,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:34,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 73 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:34,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:34,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:34,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:34,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:34,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:34,575 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 16:24:34,590 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:34,590 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:34,613 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:34,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:34,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 73 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:34,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 73 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:34,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:34,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2018-12-03 16:24:34,799 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:34,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:24:34,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:24:34,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:24:34,800 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 13 states. [2018-12-03 16:24:34,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:34,862 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2018-12-03 16:24:34,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:24:34,864 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-12-03 16:24:34,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:34,864 INFO L225 Difference]: With dead ends: 70 [2018-12-03 16:24:34,864 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 16:24:34,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 94 SyntacticMatches, 20 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:24:34,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 16:24:34,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2018-12-03 16:24:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:24:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-03 16:24:34,872 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 53 [2018-12-03 16:24:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:34,872 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-03 16:24:34,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:24:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-03 16:24:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 16:24:34,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:34,873 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2018-12-03 16:24:34,874 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:34,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:34,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1754878403, now seen corresponding path program 19 times [2018-12-03 16:24:34,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:34,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:34,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:34,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:34,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:35,684 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 220 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:35,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:35,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:35,685 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:35,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:35,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:35,685 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 16:24:35,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:35,694 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:35,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:35,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 220 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:35,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 220 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:35,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:35,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2018-12-03 16:24:35,926 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:35,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:24:35,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:24:35,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:24:35,927 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 24 states. [2018-12-03 16:24:36,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:36,193 INFO L93 Difference]: Finished difference Result 112 states and 116 transitions. [2018-12-03 16:24:36,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:24:36,194 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 57 [2018-12-03 16:24:36,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:36,195 INFO L225 Difference]: With dead ends: 112 [2018-12-03 16:24:36,195 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:24:36,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 92 SyntacticMatches, 21 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=309, Invalid=881, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:24:36,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:24:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 16:24:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 16:24:36,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-03 16:24:36,203 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 57 [2018-12-03 16:24:36,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:36,203 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-03 16:24:36,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:24:36,203 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-03 16:24:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:24:36,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:36,204 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1] [2018-12-03 16:24:36,204 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:36,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:36,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1471794070, now seen corresponding path program 20 times [2018-12-03 16:24:36,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:36,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:36,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:36,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:36,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 86 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:36,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:36,549 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:36,549 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:36,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 16:24:36,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:36,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 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 16:24:36,560 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:36,560 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:36,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 16:24:36,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:36,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 86 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:36,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 86 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:36,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:36,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 13 [2018-12-03 16:24:36,918 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:36,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:24:36,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:24:36,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:24:36,919 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 14 states. [2018-12-03 16:24:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:37,000 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-12-03 16:24:37,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:24:37,001 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2018-12-03 16:24:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:37,002 INFO L225 Difference]: With dead ends: 75 [2018-12-03 16:24:37,002 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:24:37,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 103 SyntacticMatches, 22 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:24:37,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:24:37,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 65. [2018-12-03 16:24:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 16:24:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-12-03 16:24:37,012 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 58 [2018-12-03 16:24:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:37,012 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-12-03 16:24:37,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:24:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-12-03 16:24:37,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:24:37,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:37,013 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2018-12-03 16:24:37,013 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:37,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash 716104416, now seen corresponding path program 21 times [2018-12-03 16:24:37,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:37,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:37,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:37,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:37,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:37,973 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 264 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:37,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:37,974 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:37,974 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:37,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:37,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:37,974 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 16:24:37,982 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:37,983 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:38,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:38,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:38,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:38,032 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 264 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:38,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:38,818 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 264 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:38,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:38,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2018-12-03 16:24:38,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:38,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:24:38,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:24:38,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:24:38,839 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 26 states. [2018-12-03 16:24:39,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:39,199 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2018-12-03 16:24:39,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:24:39,199 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 62 [2018-12-03 16:24:39,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:39,200 INFO L225 Difference]: With dead ends: 121 [2018-12-03 16:24:39,200 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 16:24:39,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 100 SyntacticMatches, 23 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:24:39,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 16:24:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 16:24:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 16:24:39,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-03 16:24:39,205 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2018-12-03 16:24:39,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:39,206 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-03 16:24:39,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:24:39,206 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-03 16:24:39,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 16:24:39,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:39,207 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1, 1, 1] [2018-12-03 16:24:39,207 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:39,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:39,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1699180391, now seen corresponding path program 22 times [2018-12-03 16:24:39,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:39,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:39,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:39,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:39,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:39,386 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 100 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:39,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:39,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:39,386 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:39,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 16:24:39,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:39,387 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 16:24:39,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:39,396 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:39,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:39,437 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 100 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:39,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 100 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:39,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:39,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2018-12-03 16:24:39,610 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:39,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:24:39,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:24:39,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:24:39,611 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 15 states. [2018-12-03 16:24:39,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:39,751 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2018-12-03 16:24:39,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:24:39,752 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-12-03 16:24:39,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:39,752 INFO L225 Difference]: With dead ends: 80 [2018-12-03 16:24:39,752 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 16:24:39,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 112 SyntacticMatches, 24 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:24:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 16:24:39,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-12-03 16:24:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 16:24:39,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-12-03 16:24:39,760 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2018-12-03 16:24:39,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:39,760 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-12-03 16:24:39,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:24:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-12-03 16:24:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:24:39,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:39,761 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2018-12-03 16:24:39,761 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:39,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:39,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1490448497, now seen corresponding path program 23 times [2018-12-03 16:24:39,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:39,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:39,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:39,763 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 312 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:40,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:40,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:40,738 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:40,738 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:40,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:40,738 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 16:24:40,747 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:40,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:40,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:24:40,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:40,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:40,801 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 312 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:40,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 312 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:41,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:41,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2018-12-03 16:24:41,056 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:41,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:24:41,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:24:41,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=547, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:24:41,057 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 28 states. [2018-12-03 16:24:41,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:41,479 INFO L93 Difference]: Finished difference Result 130 states and 134 transitions. [2018-12-03 16:24:41,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:24:41,480 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 67 [2018-12-03 16:24:41,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:41,481 INFO L225 Difference]: With dead ends: 130 [2018-12-03 16:24:41,481 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 16:24:41,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 108 SyntacticMatches, 25 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:24:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 16:24:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 16:24:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 16:24:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-12-03 16:24:41,487 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 67 [2018-12-03 16:24:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:41,487 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-12-03 16:24:41,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:24:41,487 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-12-03 16:24:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:24:41,488 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:41,488 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1, 1, 1] [2018-12-03 16:24:41,488 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:41,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:41,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1188334966, now seen corresponding path program 24 times [2018-12-03 16:24:41,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:41,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:41,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:41,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:41,489 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:41,893 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 115 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:41,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:41,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:41,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:41,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:41,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:41,894 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 16:24:41,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:41,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:41,938 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:41,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:41,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 115 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:41,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 115 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:42,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:42,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 15 [2018-12-03 16:24:42,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:42,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:24:42,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:24:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:24:42,596 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 16 states. [2018-12-03 16:24:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:42,677 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2018-12-03 16:24:42,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:24:42,677 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 68 [2018-12-03 16:24:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:42,678 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:24:42,678 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:24:42,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 121 SyntacticMatches, 26 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:24:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:24:42,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-12-03 16:24:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:24:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-12-03 16:24:42,685 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 68 [2018-12-03 16:24:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:42,686 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-12-03 16:24:42,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:24:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-12-03 16:24:42,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 16:24:42,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:42,686 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2018-12-03 16:24:42,686 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:42,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:42,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1190013460, now seen corresponding path program 25 times [2018-12-03 16:24:42,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:42,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:42,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:42,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:42,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:42,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 364 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:43,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:43,388 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:43,388 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:43,388 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:43,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:43,389 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 16:24:43,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:43,398 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:43,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 364 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:43,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:43,711 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 364 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:43,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:43,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2018-12-03 16:24:43,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:43,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:24:43,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:24:43,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:24:43,735 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 30 states. [2018-12-03 16:24:44,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:44,329 INFO L93 Difference]: Finished difference Result 139 states and 143 transitions. [2018-12-03 16:24:44,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:24:44,329 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 72 [2018-12-03 16:24:44,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:44,331 INFO L225 Difference]: With dead ends: 139 [2018-12-03 16:24:44,331 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:24:44,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 116 SyntacticMatches, 27 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=477, Invalid=1415, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:24:44,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:24:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:24:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:24:44,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-12-03 16:24:44,341 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 72 [2018-12-03 16:24:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:44,341 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-12-03 16:24:44,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:24:44,341 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-12-03 16:24:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 16:24:44,342 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:44,342 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1, 1, 1] [2018-12-03 16:24:44,342 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:44,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:44,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1746112411, now seen corresponding path program 26 times [2018-12-03 16:24:44,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:44,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:44,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:44,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:44,344 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:44,569 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 131 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:44,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:44,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:44,570 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:44,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:44,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:44,570 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 16:24:44,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:44,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:44,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:24:44,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:44,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:44,647 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 131 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:44,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:44,930 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 131 proven. 338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:44,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:44,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2018-12-03 16:24:44,949 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:44,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:24:44,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:24:44,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:24:44,949 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 17 states. [2018-12-03 16:24:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:45,066 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2018-12-03 16:24:45,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:24:45,069 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 73 [2018-12-03 16:24:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:45,070 INFO L225 Difference]: With dead ends: 90 [2018-12-03 16:24:45,070 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 16:24:45,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 130 SyntacticMatches, 28 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:24:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 16:24:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-12-03 16:24:45,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 16:24:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-12-03 16:24:45,079 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 73 [2018-12-03 16:24:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:45,079 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-12-03 16:24:45,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:24:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-12-03 16:24:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 16:24:45,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:45,080 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2018-12-03 16:24:45,081 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:45,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:45,081 INFO L82 PathProgramCache]: Analyzing trace with hash 613460315, now seen corresponding path program 27 times [2018-12-03 16:24:45,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:45,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:45,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:45,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:45,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:45,464 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 420 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:45,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:45,465 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:45,465 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:45,465 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:45,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:45,465 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 16:24:45,476 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:45,476 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:45,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:45,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:45,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 420 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:45,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:45,797 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 420 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:45,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:45,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2018-12-03 16:24:45,816 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:45,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:24:45,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:24:45,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:24:45,817 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 32 states. [2018-12-03 16:24:46,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:46,591 INFO L93 Difference]: Finished difference Result 148 states and 152 transitions. [2018-12-03 16:24:46,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:24:46,591 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 77 [2018-12-03 16:24:46,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:46,592 INFO L225 Difference]: With dead ends: 148 [2018-12-03 16:24:46,592 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 16:24:46,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 124 SyntacticMatches, 29 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 707 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=541, Invalid=1621, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:24:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 16:24:46,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 16:24:46,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 16:24:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-12-03 16:24:46,599 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 77 [2018-12-03 16:24:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:46,599 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-12-03 16:24:46,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:24:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-12-03 16:24:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:24:46,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:46,600 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1, 1, 1] [2018-12-03 16:24:46,600 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:46,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:46,601 INFO L82 PathProgramCache]: Analyzing trace with hash 381727362, now seen corresponding path program 28 times [2018-12-03 16:24:46,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:46,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:46,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:46,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:46,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:46,889 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 148 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:46,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:46,890 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:46,890 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:46,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:46,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:46,890 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 16:24:46,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:46,899 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:46,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:46,950 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 148 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:46,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 148 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:47,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:47,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 17 [2018-12-03 16:24:47,207 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:47,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:24:47,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:24:47,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:24:47,208 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 18 states. [2018-12-03 16:24:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:47,321 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2018-12-03 16:24:47,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:24:47,322 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 78 [2018-12-03 16:24:47,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:47,322 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:24:47,322 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 16:24:47,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 139 SyntacticMatches, 30 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:24:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 16:24:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2018-12-03 16:24:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:24:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-12-03 16:24:47,332 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 78 [2018-12-03 16:24:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:47,332 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-12-03 16:24:47,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:24:47,333 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-12-03 16:24:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 16:24:47,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:47,333 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2018-12-03 16:24:47,333 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:47,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:47,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1123248904, now seen corresponding path program 29 times [2018-12-03 16:24:47,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:47,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:47,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:47,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:47,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 480 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:47,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:47,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:47,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:47,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:47,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:47,739 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 16:24:47,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:47,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:47,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:24:47,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:47,938 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 480 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:47,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 480 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:48,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:48,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2018-12-03 16:24:48,630 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:48,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:24:48,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:24:48,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:24:48,632 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 34 states. [2018-12-03 16:24:49,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:49,183 INFO L93 Difference]: Finished difference Result 157 states and 161 transitions. [2018-12-03 16:24:49,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:24:49,183 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 82 [2018-12-03 16:24:49,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:49,184 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:24:49,184 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 16:24:49,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 132 SyntacticMatches, 31 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:24:49,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 16:24:49,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 16:24:49,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 16:24:49,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-12-03 16:24:49,194 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 82 [2018-12-03 16:24:49,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:49,194 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-12-03 16:24:49,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:24:49,194 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-12-03 16:24:49,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 16:24:49,195 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:49,195 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1, 1, 1] [2018-12-03 16:24:49,195 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:49,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:49,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1191652401, now seen corresponding path program 30 times [2018-12-03 16:24:49,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:49,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:49,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:49,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:49,197 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 166 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:49,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:49,626 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:49,626 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:49,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 16:24:49,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:49,627 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 16:24:49,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:49,647 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:49,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:49,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:49,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:49,703 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 166 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:49,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:50,543 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 166 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:50,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:50,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2018-12-03 16:24:50,562 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:50,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:24:50,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:24:50,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:24:50,563 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 19 states. [2018-12-03 16:24:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:50,688 INFO L93 Difference]: Finished difference Result 100 states and 103 transitions. [2018-12-03 16:24:50,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:24:50,688 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 83 [2018-12-03 16:24:50,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:50,689 INFO L225 Difference]: With dead ends: 100 [2018-12-03 16:24:50,689 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:24:50,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 148 SyntacticMatches, 32 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:24:50,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:24:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2018-12-03 16:24:50,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:24:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-12-03 16:24:50,698 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 83 [2018-12-03 16:24:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:50,698 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-12-03 16:24:50,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:24:50,698 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-12-03 16:24:50,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:24:50,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:50,699 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2018-12-03 16:24:50,699 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:50,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:50,699 INFO L82 PathProgramCache]: Analyzing trace with hash 219193127, now seen corresponding path program 31 times [2018-12-03 16:24:50,699 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:50,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:50,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:50,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:50,700 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:51,240 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 544 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:51,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:51,241 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:51,241 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:51,241 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:51,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:51,241 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 16:24:51,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:51,250 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:51,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:51,305 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 544 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:51,305 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:51,646 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 544 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:51,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:51,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2018-12-03 16:24:51,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:51,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:24:51,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:24:51,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=919, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:24:51,668 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 36 states. [2018-12-03 16:24:52,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:52,318 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2018-12-03 16:24:52,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:24:52,318 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 87 [2018-12-03 16:24:52,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:52,319 INFO L225 Difference]: With dead ends: 166 [2018-12-03 16:24:52,319 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:24:52,320 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 140 SyntacticMatches, 33 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=681, Invalid=2075, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:24:52,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:24:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 16:24:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 16:24:52,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-12-03 16:24:52,327 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 87 [2018-12-03 16:24:52,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:52,327 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-12-03 16:24:52,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:24:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-12-03 16:24:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 16:24:52,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:52,328 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1, 1, 1] [2018-12-03 16:24:52,328 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:52,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:52,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1134517362, now seen corresponding path program 32 times [2018-12-03 16:24:52,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:52,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:52,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:52,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:52,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 185 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:52,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:52,658 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:52,658 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:52,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:52,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:52,658 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 16:24:52,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:52,668 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:52,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 16:24:52,721 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:52,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 185 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:52,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 185 proven. 512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:53,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:53,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 19 [2018-12-03 16:24:53,018 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:53,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:24:53,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:24:53,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:24:53,019 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 20 states. [2018-12-03 16:24:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:53,151 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2018-12-03 16:24:53,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:24:53,151 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 88 [2018-12-03 16:24:53,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:53,153 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:24:53,153 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:24:53,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 157 SyntacticMatches, 34 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:24:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:24:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-12-03 16:24:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 16:24:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-12-03 16:24:53,164 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 88 [2018-12-03 16:24:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:53,164 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-12-03 16:24:53,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:24:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-12-03 16:24:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:24:53,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:53,165 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2018-12-03 16:24:53,165 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:53,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:53,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1074454524, now seen corresponding path program 33 times [2018-12-03 16:24:53,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:53,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:53,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:53,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:53,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:54,045 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 612 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:54,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:54,045 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:54,045 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:54,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:54,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:54,046 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 16:24:54,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:54,056 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:54,105 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:54,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:54,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 612 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:54,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 612 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:54,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:54,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2018-12-03 16:24:54,590 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:54,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:24:54,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:24:54,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1027, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:24:54,591 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 38 states. [2018-12-03 16:24:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:55,864 INFO L93 Difference]: Finished difference Result 175 states and 179 transitions. [2018-12-03 16:24:55,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:24:55,864 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 92 [2018-12-03 16:24:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:55,865 INFO L225 Difference]: With dead ends: 175 [2018-12-03 16:24:55,865 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 16:24:55,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 148 SyntacticMatches, 35 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=757, Invalid=2323, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:24:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 16:24:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 16:24:55,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:24:55,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-12-03 16:24:55,874 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 92 [2018-12-03 16:24:55,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:55,874 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-12-03 16:24:55,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:24:55,874 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-12-03 16:24:55,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 16:24:55,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:55,875 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1, 1, 1] [2018-12-03 16:24:55,875 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:55,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:55,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1513438211, now seen corresponding path program 34 times [2018-12-03 16:24:55,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:55,876 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:55,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:55,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:56,138 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 205 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:56,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:56,138 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:56,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:56,139 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:56,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:56,139 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 16:24:56,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:56,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:24:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:56,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 205 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:56,204 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:56,487 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 205 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:56,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:56,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2018-12-03 16:24:56,507 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:56,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:24:56,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:24:56,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:24:56,508 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 21 states. [2018-12-03 16:24:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:56,620 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2018-12-03 16:24:56,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:24:56,620 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 93 [2018-12-03 16:24:56,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:56,621 INFO L225 Difference]: With dead ends: 110 [2018-12-03 16:24:56,621 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 16:24:56,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 166 SyntacticMatches, 36 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:24:56,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 16:24:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2018-12-03 16:24:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:24:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-12-03 16:24:56,629 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 93 [2018-12-03 16:24:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:56,629 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-12-03 16:24:56,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:24:56,629 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-12-03 16:24:56,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 16:24:56,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:56,630 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2018-12-03 16:24:56,630 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:56,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:56,630 INFO L82 PathProgramCache]: Analyzing trace with hash -1385467661, now seen corresponding path program 35 times [2018-12-03 16:24:56,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:56,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:56,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:24:56,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:56,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:56,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 684 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:57,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:57,173 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:57,173 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:57,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:24:57,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:57,173 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 16:24:57,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:24:57,182 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:24:57,239 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 16:24:57,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:57,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 684 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:57,260 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:57,894 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 684 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:57,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:57,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2018-12-03 16:24:57,913 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:57,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:24:57,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:24:57,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1141, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:24:57,915 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 40 states. [2018-12-03 16:24:58,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:58,938 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2018-12-03 16:24:58,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:24:58,938 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 97 [2018-12-03 16:24:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:58,940 INFO L225 Difference]: With dead ends: 184 [2018-12-03 16:24:58,940 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 16:24:58,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 156 SyntacticMatches, 37 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=837, Invalid=2585, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:24:58,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 16:24:58,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 16:24:58,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 16:24:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-12-03 16:24:58,948 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2018-12-03 16:24:58,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:58,948 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-12-03 16:24:58,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:24:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-12-03 16:24:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:24:58,949 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:58,949 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1, 1, 1] [2018-12-03 16:24:58,950 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:58,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:58,950 INFO L82 PathProgramCache]: Analyzing trace with hash -209035110, now seen corresponding path program 36 times [2018-12-03 16:24:58,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:58,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:58,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:58,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:58,951 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:24:59,322 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 226 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:59,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:59,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:24:59,323 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:24:59,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 16:24:59,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:24:59,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 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 16:24:59,333 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:24:59,333 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:24:59,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:24:59,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:24:59,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:24:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 226 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:59,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:24:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 226 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:24:59,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:24:59,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 21 [2018-12-03 16:24:59,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:24:59,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:24:59,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:24:59,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:24:59,774 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 22 states. [2018-12-03 16:24:59,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:24:59,876 INFO L93 Difference]: Finished difference Result 115 states and 118 transitions. [2018-12-03 16:24:59,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:24:59,877 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 98 [2018-12-03 16:24:59,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:24:59,878 INFO L225 Difference]: With dead ends: 115 [2018-12-03 16:24:59,878 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:24:59,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 175 SyntacticMatches, 38 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:24:59,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:24:59,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-12-03 16:24:59,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 16:24:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-12-03 16:24:59,888 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 98 [2018-12-03 16:24:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:24:59,888 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-12-03 16:24:59,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:24:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-12-03 16:24:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:24:59,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:24:59,889 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2018-12-03 16:24:59,889 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:24:59,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:24:59,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1566476528, now seen corresponding path program 37 times [2018-12-03 16:24:59,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:24:59,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:59,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:24:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:24:59,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:24:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 760 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:00,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:00,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:00,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:00,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:00,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:00,530 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 16:25:00,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:00,539 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:00,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 760 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:00,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 760 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:01,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:01,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2018-12-03 16:25:01,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:01,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:25:01,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:25:01,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=461, Invalid=1261, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:25:01,186 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 42 states. [2018-12-03 16:25:03,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:03,773 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2018-12-03 16:25:03,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:25:03,773 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 102 [2018-12-03 16:25:03,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:03,774 INFO L225 Difference]: With dead ends: 193 [2018-12-03 16:25:03,775 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:25:03,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 164 SyntacticMatches, 39 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1292 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=921, Invalid=2861, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:25:03,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:25:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 16:25:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:25:03,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2018-12-03 16:25:03,784 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 102 [2018-12-03 16:25:03,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:03,784 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2018-12-03 16:25:03,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:25:03,785 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2018-12-03 16:25:03,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 16:25:03,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:03,785 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1, 1, 1] [2018-12-03 16:25:03,785 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:03,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:03,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1920546761, now seen corresponding path program 38 times [2018-12-03 16:25:03,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:03,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:03,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:03,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 248 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:04,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:04,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:04,879 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:04,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 16:25:04,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:04,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 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 16:25:04,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:04,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:05,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 16:25:05,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:05,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 248 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:05,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 248 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:05,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:05,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2018-12-03 16:25:05,496 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:05,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:25:05,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:25:05,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:25:05,497 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 23 states. [2018-12-03 16:25:05,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:05,614 INFO L93 Difference]: Finished difference Result 120 states and 123 transitions. [2018-12-03 16:25:05,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:25:05,615 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 103 [2018-12-03 16:25:05,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:05,616 INFO L225 Difference]: With dead ends: 120 [2018-12-03 16:25:05,617 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 16:25:05,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 184 SyntacticMatches, 40 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:25:05,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 16:25:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2018-12-03 16:25:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 16:25:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-12-03 16:25:05,629 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 103 [2018-12-03 16:25:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:05,629 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-12-03 16:25:05,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:25:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-12-03 16:25:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:25:05,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:05,630 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2018-12-03 16:25:05,630 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:05,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:05,630 INFO L82 PathProgramCache]: Analyzing trace with hash -756867393, now seen corresponding path program 39 times [2018-12-03 16:25:05,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:05,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:05,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:05,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:05,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 840 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:06,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:06,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:06,303 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:06,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:06,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:06,303 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 16:25:06,311 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:06,311 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:06,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:06,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:06,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 840 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:06,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 840 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:08,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:08,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2018-12-03 16:25:08,246 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:08,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:25:08,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:25:08,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1387, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:25:08,247 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 44 states. [2018-12-03 16:25:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:09,555 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2018-12-03 16:25:09,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:25:09,555 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 107 [2018-12-03 16:25:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:09,556 INFO L225 Difference]: With dead ends: 202 [2018-12-03 16:25:09,556 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:25:09,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 172 SyntacticMatches, 41 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1430 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1009, Invalid=3151, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:25:09,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:25:09,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 16:25:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:25:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-12-03 16:25:09,567 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 107 [2018-12-03 16:25:09,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:09,567 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-12-03 16:25:09,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:25:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-12-03 16:25:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:25:09,568 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:09,568 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1, 1, 1, 1] [2018-12-03 16:25:09,568 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:09,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:09,568 INFO L82 PathProgramCache]: Analyzing trace with hash 798222758, now seen corresponding path program 40 times [2018-12-03 16:25:09,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:09,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:09,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:09,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 271 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:11,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:11,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:11,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:11,158 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:11,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:11,158 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 16:25:11,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:11,167 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:11,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 271 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:11,233 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:11,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 271 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:11,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:11,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 23 [2018-12-03 16:25:11,734 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:11,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:25:11,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:25:11,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:25:11,735 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 24 states. [2018-12-03 16:25:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:11,862 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2018-12-03 16:25:11,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:25:11,863 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 108 [2018-12-03 16:25:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:11,863 INFO L225 Difference]: With dead ends: 125 [2018-12-03 16:25:11,863 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 16:25:11,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 193 SyntacticMatches, 42 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:25:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 16:25:11,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-12-03 16:25:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:25:11,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-12-03 16:25:11,876 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 108 [2018-12-03 16:25:11,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:11,876 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-12-03 16:25:11,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:25:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-12-03 16:25:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 16:25:11,877 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:11,877 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2018-12-03 16:25:11,877 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:11,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:11,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1030199836, now seen corresponding path program 41 times [2018-12-03 16:25:11,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:11,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:11,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:11,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:11,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 924 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:12,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:12,927 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:12,927 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:12,928 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:12,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:12,928 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 16:25:12,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:12,937 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:13,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:25:13,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:13,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:13,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 924 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:13,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1155 backedges. 924 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:13,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:13,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2018-12-03 16:25:13,856 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:13,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:25:13,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:25:13,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:25:13,858 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 46 states. [2018-12-03 16:25:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:14,942 INFO L93 Difference]: Finished difference Result 211 states and 215 transitions. [2018-12-03 16:25:14,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:25:14,943 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 112 [2018-12-03 16:25:14,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:14,943 INFO L225 Difference]: With dead ends: 211 [2018-12-03 16:25:14,944 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 16:25:14,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 180 SyntacticMatches, 43 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1101, Invalid=3455, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:25:14,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 16:25:14,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 16:25:14,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 16:25:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-12-03 16:25:14,958 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 112 [2018-12-03 16:25:14,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:14,959 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-12-03 16:25:14,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:25:14,959 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-12-03 16:25:14,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:25:14,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:14,960 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1, 1, 1, 1] [2018-12-03 16:25:14,960 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:14,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:14,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1949005931, now seen corresponding path program 42 times [2018-12-03 16:25:14,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:14,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:14,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:14,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:14,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 295 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:16,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:16,306 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:16,306 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:16,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:16,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:16,307 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 16:25:16,316 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:16,317 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:16,368 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:16,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:16,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 295 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:16,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:16,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 295 proven. 882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:16,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:16,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2018-12-03 16:25:16,959 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:16,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:25:16,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:25:16,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:25:16,960 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 25 states. [2018-12-03 16:25:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:17,076 INFO L93 Difference]: Finished difference Result 130 states and 133 transitions. [2018-12-03 16:25:17,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:25:17,077 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 113 [2018-12-03 16:25:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:17,078 INFO L225 Difference]: With dead ends: 130 [2018-12-03 16:25:17,078 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 16:25:17,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 202 SyntacticMatches, 44 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 484 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-12-03 16:25:17,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 16:25:17,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-12-03 16:25:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 16:25:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-12-03 16:25:17,092 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 113 [2018-12-03 16:25:17,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:17,093 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-12-03 16:25:17,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:25:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-12-03 16:25:17,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 16:25:17,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:17,094 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2018-12-03 16:25:17,094 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:17,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:17,094 INFO L82 PathProgramCache]: Analyzing trace with hash 725198987, now seen corresponding path program 43 times [2018-12-03 16:25:17,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:17,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:17,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:17,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:17,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:18,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 1012 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:18,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:18,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:18,468 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:18,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:18,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:18,468 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 16:25:18,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:18,482 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:18,544 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:18,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 1012 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:18,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 1012 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:19,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:19,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2018-12-03 16:25:19,544 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:19,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:25:19,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:25:19,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=599, Invalid=1657, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:25:19,546 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 48 states. [2018-12-03 16:25:20,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:20,733 INFO L93 Difference]: Finished difference Result 220 states and 224 transitions. [2018-12-03 16:25:20,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:25:20,733 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 117 [2018-12-03 16:25:20,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:20,734 INFO L225 Difference]: With dead ends: 220 [2018-12-03 16:25:20,734 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 16:25:20,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 188 SyntacticMatches, 45 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1197, Invalid=3773, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:25:20,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 16:25:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 16:25:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 16:25:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-12-03 16:25:20,744 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 117 [2018-12-03 16:25:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:20,744 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-12-03 16:25:20,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:25:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-12-03 16:25:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 16:25:20,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:20,745 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1, 1, 1] [2018-12-03 16:25:20,746 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:20,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:20,746 INFO L82 PathProgramCache]: Analyzing trace with hash 995311282, now seen corresponding path program 44 times [2018-12-03 16:25:20,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:20,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:20,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:20,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:20,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:21,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 320 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:21,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:21,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:21,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:21,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:21,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:21,172 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 16:25:21,182 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:21,182 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:21,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 16:25:21,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:21,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 320 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:21,279 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 320 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:21,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:21,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 25 [2018-12-03 16:25:21,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:21,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:25:21,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:25:21,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:25:21,870 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 26 states. [2018-12-03 16:25:21,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:21,999 INFO L93 Difference]: Finished difference Result 135 states and 138 transitions. [2018-12-03 16:25:22,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:25:22,000 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2018-12-03 16:25:22,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:22,001 INFO L225 Difference]: With dead ends: 135 [2018-12-03 16:25:22,002 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 16:25:22,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 211 SyntacticMatches, 46 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:25:22,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 16:25:22,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-12-03 16:25:22,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-03 16:25:22,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-12-03 16:25:22,014 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 118 [2018-12-03 16:25:22,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:22,015 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-12-03 16:25:22,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:25:22,015 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-12-03 16:25:22,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 16:25:22,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:22,016 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2018-12-03 16:25:22,016 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:22,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:22,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1935656, now seen corresponding path program 45 times [2018-12-03 16:25:22,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:22,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:22,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:22,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:23,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 1104 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:23,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:23,134 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:23,135 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:23,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:23,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:23,135 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 16:25:23,145 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:23,145 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:23,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:23,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:23,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:23,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 1104 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:23,257 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:24,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 1104 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:24,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:24,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 49 [2018-12-03 16:25:24,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:24,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:25:24,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:25:24,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1801, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:25:24,323 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 50 states. [2018-12-03 16:25:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:25,402 INFO L93 Difference]: Finished difference Result 229 states and 233 transitions. [2018-12-03 16:25:25,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:25:25,402 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 122 [2018-12-03 16:25:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:25,403 INFO L225 Difference]: With dead ends: 229 [2018-12-03 16:25:25,403 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 16:25:25,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 196 SyntacticMatches, 47 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1886 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1297, Invalid=4105, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:25:25,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 16:25:25,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 16:25:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 16:25:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-12-03 16:25:25,417 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 122 [2018-12-03 16:25:25,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:25,418 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-12-03 16:25:25,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:25:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-12-03 16:25:25,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 16:25:25,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:25,419 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1, 1, 1, 1] [2018-12-03 16:25:25,419 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:25,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:25,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1360966497, now seen corresponding path program 46 times [2018-12-03 16:25:25,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:25,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:25,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:25,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:25,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:25,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 346 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:25,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:25,978 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:25,978 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:25,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:25,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:25,978 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 16:25:25,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:25,987 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:26,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:26,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 346 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:26,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:26,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 346 proven. 1058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:26,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:26,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2018-12-03 16:25:26,728 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:26,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:25:26,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:25:26,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:25:26,729 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 27 states. [2018-12-03 16:25:26,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:26,865 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2018-12-03 16:25:26,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:25:26,865 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 123 [2018-12-03 16:25:26,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:26,867 INFO L225 Difference]: With dead ends: 140 [2018-12-03 16:25:26,867 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 16:25:26,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 220 SyntacticMatches, 48 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-12-03 16:25:26,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 16:25:26,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2018-12-03 16:25:26,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 16:25:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-12-03 16:25:26,878 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 123 [2018-12-03 16:25:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:26,879 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-12-03 16:25:26,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:25:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-12-03 16:25:26,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 16:25:26,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:26,880 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2018-12-03 16:25:26,880 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:26,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:26,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1531900329, now seen corresponding path program 47 times [2018-12-03 16:25:26,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:26,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:26,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:26,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:26,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:27,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 1200 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:27,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:27,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:27,802 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:27,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:27,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:27,802 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 16:25:27,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:27,812 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:27,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:25:27,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:27,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 1200 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:27,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 1200 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:28,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:28,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 16:25:28,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:28,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:25:28,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:25:28,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=1951, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:25:28,714 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 52 states. [2018-12-03 16:25:30,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:30,253 INFO L93 Difference]: Finished difference Result 238 states and 242 transitions. [2018-12-03 16:25:30,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:25:30,253 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 127 [2018-12-03 16:25:30,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:30,254 INFO L225 Difference]: With dead ends: 238 [2018-12-03 16:25:30,254 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 16:25:30,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 204 SyntacticMatches, 49 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2052 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1401, Invalid=4451, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:25:30,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 16:25:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 16:25:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 16:25:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-12-03 16:25:30,269 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 127 [2018-12-03 16:25:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:30,269 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-12-03 16:25:30,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:25:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-12-03 16:25:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 16:25:30,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:30,270 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1, 1, 1, 1] [2018-12-03 16:25:30,271 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:30,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:30,271 INFO L82 PathProgramCache]: Analyzing trace with hash -652320834, now seen corresponding path program 48 times [2018-12-03 16:25:30,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:30,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:30,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:30,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 373 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:30,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:30,819 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:30,819 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:30,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:30,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:30,819 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 16:25:30,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:30,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:30,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:30,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:30,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:30,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 373 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:30,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 373 proven. 1152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:31,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:31,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 27 [2018-12-03 16:25:31,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:31,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:25:31,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:25:31,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:25:31,482 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 28 states. [2018-12-03 16:25:31,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:31,626 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2018-12-03 16:25:31,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:25:31,626 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 128 [2018-12-03 16:25:31,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:31,627 INFO L225 Difference]: With dead ends: 145 [2018-12-03 16:25:31,627 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 16:25:31,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 229 SyntacticMatches, 50 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 625 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:25:31,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 16:25:31,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 135. [2018-12-03 16:25:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 16:25:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-12-03 16:25:31,642 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 128 [2018-12-03 16:25:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:31,642 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-12-03 16:25:31,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:25:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-12-03 16:25:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 16:25:31,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:31,643 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2018-12-03 16:25:31,643 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:31,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:31,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1843837900, now seen corresponding path program 49 times [2018-12-03 16:25:31,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:31,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:31,644 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:31,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:31,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:32,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 1300 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:32,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:32,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:32,828 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:32,828 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:32,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:32,829 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 16:25:32,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:32,837 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:32,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 1300 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:32,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:34,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1625 backedges. 1300 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:34,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:34,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-12-03 16:25:34,076 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:34,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:25:34,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:25:34,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=755, Invalid=2107, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:25:34,077 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 54 states. [2018-12-03 16:25:35,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:35,543 INFO L93 Difference]: Finished difference Result 247 states and 251 transitions. [2018-12-03 16:25:35,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:25:35,543 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 132 [2018-12-03 16:25:35,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:35,544 INFO L225 Difference]: With dead ends: 247 [2018-12-03 16:25:35,544 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 16:25:35,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 212 SyntacticMatches, 51 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2225 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1509, Invalid=4811, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:25:35,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 16:25:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 16:25:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 16:25:35,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-12-03 16:25:35,555 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2018-12-03 16:25:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:35,556 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-12-03 16:25:35,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:25:35,556 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-12-03 16:25:35,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 16:25:35,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:35,556 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1, 1, 1, 1] [2018-12-03 16:25:35,557 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:35,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:35,557 INFO L82 PathProgramCache]: Analyzing trace with hash 35240749, now seen corresponding path program 50 times [2018-12-03 16:25:35,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:35,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:35,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:35,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:35,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:35,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 401 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:36,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:36,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:36,201 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:36,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:36,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:36,201 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 16:25:36,212 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:36,212 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:36,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:25:36,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:36,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 401 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:36,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:37,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 401 proven. 1250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:37,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:37,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2018-12-03 16:25:37,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:37,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:25:37,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:25:37,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:25:37,606 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 29 states. [2018-12-03 16:25:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:37,754 INFO L93 Difference]: Finished difference Result 150 states and 153 transitions. [2018-12-03 16:25:37,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:25:37,755 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 133 [2018-12-03 16:25:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:37,756 INFO L225 Difference]: With dead ends: 150 [2018-12-03 16:25:37,756 INFO L226 Difference]: Without dead ends: 144 [2018-12-03 16:25:37,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 238 SyntacticMatches, 52 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:25:37,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-03 16:25:37,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 140. [2018-12-03 16:25:37,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 16:25:37,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-12-03 16:25:37,772 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 133 [2018-12-03 16:25:37,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:37,772 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-12-03 16:25:37,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:25:37,772 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-12-03 16:25:37,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 16:25:37,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:37,773 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2018-12-03 16:25:37,773 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:37,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:37,774 INFO L82 PathProgramCache]: Analyzing trace with hash -838119389, now seen corresponding path program 51 times [2018-12-03 16:25:37,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:37,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:37,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:37,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:37,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 1404 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:38,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:38,732 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:38,732 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:38,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:38,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:38,732 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 16:25:38,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:38,740 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:38,806 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:38,807 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:38,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:38,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 1404 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:38,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1755 backedges. 1404 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:40,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:40,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2018-12-03 16:25:40,028 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:40,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:25:40,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:25:40,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2269, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:25:40,029 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 56 states. [2018-12-03 16:25:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:41,542 INFO L93 Difference]: Finished difference Result 256 states and 260 transitions. [2018-12-03 16:25:41,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:25:41,542 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 137 [2018-12-03 16:25:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:41,543 INFO L225 Difference]: With dead ends: 256 [2018-12-03 16:25:41,543 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 16:25:41,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 220 SyntacticMatches, 53 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2405 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1621, Invalid=5185, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:25:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 16:25:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 16:25:41,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 16:25:41,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2018-12-03 16:25:41,560 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 137 [2018-12-03 16:25:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:41,560 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2018-12-03 16:25:41,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:25:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2018-12-03 16:25:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 16:25:41,561 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:41,561 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1, 1, 1, 1] [2018-12-03 16:25:41,562 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:41,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:41,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1657490634, now seen corresponding path program 52 times [2018-12-03 16:25:41,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:41,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:41,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:41,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:41,563 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:41,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 430 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:41,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:41,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:41,986 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:41,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:41,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:41,987 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 16:25:41,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:41,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:42,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 430 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:42,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:42,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 430 proven. 1352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:42,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:42,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 29 [2018-12-03 16:25:42,739 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:42,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:25:42,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:25:42,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:25:42,740 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 30 states. [2018-12-03 16:25:42,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:42,894 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2018-12-03 16:25:42,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:25:42,895 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 138 [2018-12-03 16:25:42,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:42,896 INFO L225 Difference]: With dead ends: 155 [2018-12-03 16:25:42,896 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 16:25:42,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 247 SyntacticMatches, 54 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:25:42,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 16:25:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2018-12-03 16:25:42,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 16:25:42,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-12-03 16:25:42,912 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 138 [2018-12-03 16:25:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:42,912 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-12-03 16:25:42,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:25:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-12-03 16:25:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 16:25:42,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:42,913 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2018-12-03 16:25:42,913 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:42,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:42,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1915800384, now seen corresponding path program 53 times [2018-12-03 16:25:42,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:42,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:42,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:42,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:42,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1512 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:43,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:43,875 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:43,875 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:43,875 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:43,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:43,875 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 16:25:43,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:43,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:43,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:25:43,980 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:43,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:44,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1512 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:44,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1890 backedges. 1512 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:45,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:45,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2018-12-03 16:25:45,239 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:45,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:25:45,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:25:45,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:25:45,240 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 58 states. [2018-12-03 16:25:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:46,844 INFO L93 Difference]: Finished difference Result 265 states and 269 transitions. [2018-12-03 16:25:46,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:25:46,844 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 142 [2018-12-03 16:25:46,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:46,845 INFO L225 Difference]: With dead ends: 265 [2018-12-03 16:25:46,845 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 16:25:46,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 228 SyntacticMatches, 55 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2592 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1737, Invalid=5573, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:25:46,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 16:25:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 16:25:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 16:25:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2018-12-03 16:25:46,858 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 142 [2018-12-03 16:25:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:46,859 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2018-12-03 16:25:46,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:25:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2018-12-03 16:25:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 16:25:46,859 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:46,860 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1, 1, 1, 1] [2018-12-03 16:25:46,860 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:46,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash 520593145, now seen corresponding path program 54 times [2018-12-03 16:25:46,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:46,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:46,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:47,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 460 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:47,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:47,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:47,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:47,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:47,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:47,432 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 16:25:47,441 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:47,441 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:47,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:47,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:47,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 460 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:47,544 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:48,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 460 proven. 1458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:48,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:48,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2018-12-03 16:25:48,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:48,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:25:48,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:25:48,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:25:48,308 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 31 states. [2018-12-03 16:25:48,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:48,483 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-12-03 16:25:48,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:25:48,485 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 143 [2018-12-03 16:25:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:48,486 INFO L225 Difference]: With dead ends: 160 [2018-12-03 16:25:48,486 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 16:25:48,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 256 SyntacticMatches, 56 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:25:48,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 16:25:48,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2018-12-03 16:25:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 16:25:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-12-03 16:25:48,499 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 143 [2018-12-03 16:25:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:48,499 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-12-03 16:25:48,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:25:48,499 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-12-03 16:25:48,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 16:25:48,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:48,500 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2018-12-03 16:25:48,500 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:48,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:48,500 INFO L82 PathProgramCache]: Analyzing trace with hash 915041775, now seen corresponding path program 55 times [2018-12-03 16:25:48,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:48,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:48,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:48,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 1624 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:49,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:49,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:49,934 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:49,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:49,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:49,934 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 16:25:49,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:49,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:50,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:50,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 1624 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:50,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:51,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 1624 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:51,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:51,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2018-12-03 16:25:51,346 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:51,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:25:51,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:25:51,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=929, Invalid=2611, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:25:51,347 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 60 states. [2018-12-03 16:25:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:53,071 INFO L93 Difference]: Finished difference Result 274 states and 278 transitions. [2018-12-03 16:25:53,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:25:53,071 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 147 [2018-12-03 16:25:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:53,072 INFO L225 Difference]: With dead ends: 274 [2018-12-03 16:25:53,072 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 16:25:53,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 236 SyntacticMatches, 57 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2786 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1857, Invalid=5975, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 16:25:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 16:25:53,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 16:25:53,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 16:25:53,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-12-03 16:25:53,085 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 147 [2018-12-03 16:25:53,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:53,085 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-12-03 16:25:53,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:25:53,086 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-12-03 16:25:53,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 16:25:53,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:53,086 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1, 1, 1, 1] [2018-12-03 16:25:53,086 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:53,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:53,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1773143510, now seen corresponding path program 56 times [2018-12-03 16:25:53,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:53,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:53,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:53,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:53,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 491 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:53,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:53,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:53,563 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:53,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:53,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:53,564 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 16:25:53,572 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:25:53,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:25:53,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 16:25:53,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:53,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:53,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 491 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:53,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 491 proven. 1568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:54,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:54,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 31 [2018-12-03 16:25:54,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:54,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:25:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:25:54,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:25:54,398 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 32 states. [2018-12-03 16:25:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:54,587 INFO L93 Difference]: Finished difference Result 165 states and 168 transitions. [2018-12-03 16:25:54,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:25:54,587 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 148 [2018-12-03 16:25:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:54,588 INFO L225 Difference]: With dead ends: 165 [2018-12-03 16:25:54,588 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 16:25:54,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 265 SyntacticMatches, 58 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:25:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 16:25:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2018-12-03 16:25:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 16:25:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2018-12-03 16:25:54,603 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 148 [2018-12-03 16:25:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:54,603 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2018-12-03 16:25:54,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:25:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2018-12-03 16:25:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 16:25:54,604 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:54,605 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2018-12-03 16:25:54,605 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:54,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:54,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1766187444, now seen corresponding path program 57 times [2018-12-03 16:25:54,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:54,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:54,606 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:54,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:54,606 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:55,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 1740 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:55,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:55,923 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:55,923 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:55,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 16:25:55,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:55,924 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 16:25:55,932 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:25:55,932 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:25:56,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:25:56,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:25:56,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 1740 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:56,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:25:57,122 INFO L134 CoverageAnalysis]: Checked inductivity of 2175 backedges. 1740 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:57,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:25:57,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 61 [2018-12-03 16:25:57,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:25:57,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:25:57,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:25:57,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=991, Invalid=2791, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:25:57,142 INFO L87 Difference]: Start difference. First operand 155 states and 157 transitions. Second operand 62 states. [2018-12-03 16:25:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:25:58,992 INFO L93 Difference]: Finished difference Result 283 states and 287 transitions. [2018-12-03 16:25:58,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:25:58,992 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 152 [2018-12-03 16:25:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:25:58,993 INFO L225 Difference]: With dead ends: 283 [2018-12-03 16:25:58,993 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 16:25:58,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 244 SyntacticMatches, 59 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2987 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1981, Invalid=6391, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:25:58,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 16:25:59,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 16:25:59,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 16:25:59,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-12-03 16:25:59,007 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 152 [2018-12-03 16:25:59,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:25:59,007 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-12-03 16:25:59,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:25:59,007 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-12-03 16:25:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 16:25:59,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:25:59,008 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1, 1, 1, 1] [2018-12-03 16:25:59,008 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:25:59,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:25:59,009 INFO L82 PathProgramCache]: Analyzing trace with hash -928358715, now seen corresponding path program 58 times [2018-12-03 16:25:59,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:25:59,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:59,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:25:59,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:25:59,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:25:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 523 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:59,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:59,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:25:59,608 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:25:59,608 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:25:59,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:25:59,608 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 16:25:59,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:25:59,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:25:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:25:59,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:25:59,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 523 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:25:59,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 523 proven. 1682 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:00,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:00,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2018-12-03 16:26:00,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:00,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:26:00,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:26:00,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:26:00,743 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 33 states. [2018-12-03 16:26:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:00,926 INFO L93 Difference]: Finished difference Result 170 states and 173 transitions. [2018-12-03 16:26:00,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:26:00,926 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 153 [2018-12-03 16:26:00,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:00,927 INFO L225 Difference]: With dead ends: 170 [2018-12-03 16:26:00,927 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 16:26:00,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 274 SyntacticMatches, 60 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 900 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 16:26:00,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 16:26:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2018-12-03 16:26:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 16:26:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-12-03 16:26:00,946 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 153 [2018-12-03 16:26:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:00,946 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-12-03 16:26:00,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:26:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-12-03 16:26:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 16:26:00,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:00,948 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2018-12-03 16:26:00,948 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:00,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash -839882821, now seen corresponding path program 59 times [2018-12-03 16:26:00,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:00,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:00,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:00,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:00,949 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 1860 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:02,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:02,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:02,231 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:02,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:02,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:02,231 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 16:26:02,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:02,240 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:02,343 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 16:26:02,343 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:02,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 1860 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:02,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2325 backedges. 1860 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:03,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:03,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2018-12-03 16:26:03,504 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:03,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:26:03,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:26:03,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:26:03,505 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 64 states. [2018-12-03 16:26:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:04,694 INFO L93 Difference]: Finished difference Result 292 states and 296 transitions. [2018-12-03 16:26:04,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:26:04,694 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 157 [2018-12-03 16:26:04,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:04,695 INFO L225 Difference]: With dead ends: 292 [2018-12-03 16:26:04,695 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 16:26:04,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 252 SyntacticMatches, 61 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3195 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2109, Invalid=6821, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 16:26:04,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 16:26:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-03 16:26:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 16:26:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2018-12-03 16:26:04,715 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 157 [2018-12-03 16:26:04,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:04,715 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2018-12-03 16:26:04,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:26:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-12-03 16:26:04,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 16:26:04,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:04,716 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1, 1, 1, 1] [2018-12-03 16:26:04,716 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:04,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:04,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1453492962, now seen corresponding path program 60 times [2018-12-03 16:26:04,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:04,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:04,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:04,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:04,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 556 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:05,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:05,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:05,525 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:05,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:05,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:05,525 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 16:26:05,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:05,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:05,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:05,610 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:05,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:05,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 556 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:05,639 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 556 proven. 1800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:06,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:06,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 33 [2018-12-03 16:26:06,404 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:06,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:26:06,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:26:06,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:26:06,405 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 34 states. [2018-12-03 16:26:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:06,576 INFO L93 Difference]: Finished difference Result 175 states and 178 transitions. [2018-12-03 16:26:06,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:26:06,576 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 158 [2018-12-03 16:26:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:06,577 INFO L225 Difference]: With dead ends: 175 [2018-12-03 16:26:06,577 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 16:26:06,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 283 SyntacticMatches, 62 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:26:06,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 16:26:06,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2018-12-03 16:26:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 16:26:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 167 transitions. [2018-12-03 16:26:06,600 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 167 transitions. Word has length 158 [2018-12-03 16:26:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:06,601 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 167 transitions. [2018-12-03 16:26:06,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:26:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 167 transitions. [2018-12-03 16:26:06,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 16:26:06,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:06,602 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2018-12-03 16:26:06,602 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:06,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:06,602 INFO L82 PathProgramCache]: Analyzing trace with hash 227229016, now seen corresponding path program 61 times [2018-12-03 16:26:06,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:06,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:06,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:06,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:06,604 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 2480 backedges. 1984 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:07,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:07,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:07,896 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:07,896 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:07,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:07,897 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 16:26:07,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:07,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:07,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2480 backedges. 1984 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:08,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 2480 backedges. 1984 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:09,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:09,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 65 [2018-12-03 16:26:09,191 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:09,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:26:09,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:26:09,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1121, Invalid=3169, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:26:09,192 INFO L87 Difference]: Start difference. First operand 165 states and 167 transitions. Second operand 66 states. [2018-12-03 16:26:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:11,566 INFO L93 Difference]: Finished difference Result 301 states and 305 transitions. [2018-12-03 16:26:11,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:26:11,566 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 162 [2018-12-03 16:26:11,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:11,567 INFO L225 Difference]: With dead ends: 301 [2018-12-03 16:26:11,567 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 16:26:11,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 260 SyntacticMatches, 63 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3410 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2241, Invalid=7265, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:26:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 16:26:11,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 16:26:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 16:26:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2018-12-03 16:26:11,587 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 162 [2018-12-03 16:26:11,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:11,587 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2018-12-03 16:26:11,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:26:11,587 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2018-12-03 16:26:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 16:26:11,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:11,588 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1, 1, 1, 1] [2018-12-03 16:26:11,588 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:11,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash 541325969, now seen corresponding path program 62 times [2018-12-03 16:26:11,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:11,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:11,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:11,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:11,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 590 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:12,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:12,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:12,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:12,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:12,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:12,088 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 16:26:12,097 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:12,097 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:12,215 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 16:26:12,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:12,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 590 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:12,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:13,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 590 proven. 1922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:13,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:13,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2018-12-03 16:26:13,057 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:13,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:26:13,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:26:13,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:26:13,058 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 35 states. [2018-12-03 16:26:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:13,254 INFO L93 Difference]: Finished difference Result 180 states and 183 transitions. [2018-12-03 16:26:13,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:26:13,254 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 163 [2018-12-03 16:26:13,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:13,255 INFO L225 Difference]: With dead ends: 180 [2018-12-03 16:26:13,255 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 16:26:13,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 292 SyntacticMatches, 64 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:26:13,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 16:26:13,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2018-12-03 16:26:13,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 16:26:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2018-12-03 16:26:13,271 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 163 [2018-12-03 16:26:13,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:13,271 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2018-12-03 16:26:13,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:26:13,271 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2018-12-03 16:26:13,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 16:26:13,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:13,272 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2018-12-03 16:26:13,272 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:13,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:13,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1149189511, now seen corresponding path program 63 times [2018-12-03 16:26:13,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:13,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:13,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:13,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:13,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 2112 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:14,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:14,561 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:14,561 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:14,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:14,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:14,561 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 16:26:14,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:14,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:14,649 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:14,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:14,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 2112 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:14,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2640 backedges. 2112 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:16,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:16,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 67 [2018-12-03 16:26:16,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:16,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:26:16,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:26:16,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3367, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:26:16,319 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 68 states. [2018-12-03 16:26:18,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:18,508 INFO L93 Difference]: Finished difference Result 310 states and 314 transitions. [2018-12-03 16:26:18,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:26:18,508 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 167 [2018-12-03 16:26:18,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:18,509 INFO L225 Difference]: With dead ends: 310 [2018-12-03 16:26:18,510 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 16:26:18,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 268 SyntacticMatches, 65 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3632 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2377, Invalid=7723, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 16:26:18,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 16:26:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-03 16:26:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 16:26:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2018-12-03 16:26:18,530 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2018-12-03 16:26:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:18,531 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2018-12-03 16:26:18,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:26:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2018-12-03 16:26:18,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 16:26:18,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:18,532 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1, 1, 1, 1] [2018-12-03 16:26:18,532 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:18,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:18,532 INFO L82 PathProgramCache]: Analyzing trace with hash 167304174, now seen corresponding path program 64 times [2018-12-03 16:26:18,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:18,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:18,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:18,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:18,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:19,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 625 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:19,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:19,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:19,316 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:19,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:19,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:19,316 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 16:26:19,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:19,327 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:19,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 625 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:19,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 625 proven. 2048 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:20,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:20,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 35 [2018-12-03 16:26:20,629 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:20,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:26:20,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:26:20,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:26:20,630 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 36 states. [2018-12-03 16:26:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:20,807 INFO L93 Difference]: Finished difference Result 185 states and 188 transitions. [2018-12-03 16:26:20,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:26:20,807 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 168 [2018-12-03 16:26:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:20,808 INFO L225 Difference]: With dead ends: 185 [2018-12-03 16:26:20,809 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 16:26:20,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 301 SyntacticMatches, 66 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:26:20,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 16:26:20,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 175. [2018-12-03 16:26:20,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 16:26:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2018-12-03 16:26:20,830 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 168 [2018-12-03 16:26:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:20,830 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2018-12-03 16:26:20,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:26:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2018-12-03 16:26:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 16:26:20,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:20,831 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2018-12-03 16:26:20,831 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:20,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:20,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1678104476, now seen corresponding path program 65 times [2018-12-03 16:26:20,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:20,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:20,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:20,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:20,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2805 backedges. 2244 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:22,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:22,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:22,268 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:22,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:22,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:22,268 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 16:26:22,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:22,277 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:22,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:26:22,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:22,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2805 backedges. 2244 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:22,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2805 backedges. 2244 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:23,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:23,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2018-12-03 16:26:23,945 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:23,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:26:23,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:26:23,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3571, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:26:23,947 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 70 states. [2018-12-03 16:26:25,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:25,980 INFO L93 Difference]: Finished difference Result 319 states and 323 transitions. [2018-12-03 16:26:25,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:26:25,980 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 172 [2018-12-03 16:26:25,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:25,981 INFO L225 Difference]: With dead ends: 319 [2018-12-03 16:26:25,981 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 16:26:25,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 276 SyntacticMatches, 67 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2517, Invalid=8195, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:26:25,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 16:26:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-12-03 16:26:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 16:26:26,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2018-12-03 16:26:26,003 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 172 [2018-12-03 16:26:26,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:26,003 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2018-12-03 16:26:26,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:26:26,004 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2018-12-03 16:26:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 16:26:26,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:26,005 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1, 1, 1, 1] [2018-12-03 16:26:26,005 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:26,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:26,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1483312547, now seen corresponding path program 66 times [2018-12-03 16:26:26,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:26,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:26,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:26,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:26,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:26,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 661 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:26,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:26,550 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:26,550 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:26,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:26,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:26,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 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 16:26:26,558 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:26,558 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:26,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:26,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:26,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 661 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:26,673 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:27,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 661 proven. 2178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:27,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:27,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2018-12-03 16:26:27,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:27,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:26:27,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:26:27,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 16:26:27,604 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 37 states. [2018-12-03 16:26:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:27,796 INFO L93 Difference]: Finished difference Result 190 states and 193 transitions. [2018-12-03 16:26:27,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:26:27,797 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 173 [2018-12-03 16:26:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:27,797 INFO L225 Difference]: With dead ends: 190 [2018-12-03 16:26:27,798 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 16:26:27,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 310 SyntacticMatches, 68 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1156 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 16:26:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 16:26:27,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2018-12-03 16:26:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 16:26:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-12-03 16:26:27,819 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 173 [2018-12-03 16:26:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:27,819 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-12-03 16:26:27,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:26:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-12-03 16:26:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 16:26:27,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:27,820 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2018-12-03 16:26:27,821 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:27,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:27,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1794699091, now seen corresponding path program 67 times [2018-12-03 16:26:27,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:27,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:27,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:27,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:27,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:27,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:29,277 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 2380 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:29,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:29,277 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:29,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:29,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:29,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:29,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 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 16:26:29,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:29,286 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:29,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:29,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 2380 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:29,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:31,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2975 backedges. 2380 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:31,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:31,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 71 [2018-12-03 16:26:31,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:31,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:26:31,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:26:31,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=3781, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:26:31,031 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 72 states. [2018-12-03 16:26:32,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:32,862 INFO L93 Difference]: Finished difference Result 328 states and 332 transitions. [2018-12-03 16:26:32,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:26:32,862 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 177 [2018-12-03 16:26:32,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:32,863 INFO L225 Difference]: With dead ends: 328 [2018-12-03 16:26:32,863 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 16:26:32,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 284 SyntacticMatches, 69 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4097 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2661, Invalid=8681, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 16:26:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 16:26:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 16:26:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 16:26:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 183 transitions. [2018-12-03 16:26:32,881 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 183 transitions. Word has length 177 [2018-12-03 16:26:32,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:32,881 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 183 transitions. [2018-12-03 16:26:32,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:26:32,881 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 183 transitions. [2018-12-03 16:26:32,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 16:26:32,882 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:32,882 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1, 1, 1, 1] [2018-12-03 16:26:32,882 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:32,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:32,882 INFO L82 PathProgramCache]: Analyzing trace with hash 2072574202, now seen corresponding path program 68 times [2018-12-03 16:26:32,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:32,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:32,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:32,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:32,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:33,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 698 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:33,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:33,495 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:33,495 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:33,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:33,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:33,495 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 16:26:33,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:33,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:33,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 16:26:33,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:33,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 698 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:33,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:34,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 698 proven. 2312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:34,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:34,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 37 [2018-12-03 16:26:34,675 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:34,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:26:34,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:26:34,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:26:34,677 INFO L87 Difference]: Start difference. First operand 181 states and 183 transitions. Second operand 38 states. [2018-12-03 16:26:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:34,909 INFO L93 Difference]: Finished difference Result 195 states and 198 transitions. [2018-12-03 16:26:34,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:26:34,909 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 178 [2018-12-03 16:26:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:34,910 INFO L225 Difference]: With dead ends: 195 [2018-12-03 16:26:34,910 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 16:26:34,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 319 SyntacticMatches, 70 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:26:34,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 16:26:34,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2018-12-03 16:26:34,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-03 16:26:34,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2018-12-03 16:26:34,927 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 178 [2018-12-03 16:26:34,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:34,927 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2018-12-03 16:26:34,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:26:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2018-12-03 16:26:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 16:26:34,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:34,928 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2018-12-03 16:26:34,928 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:34,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:34,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1591533424, now seen corresponding path program 69 times [2018-12-03 16:26:34,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:34,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:34,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:34,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:34,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:34,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 2520 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:36,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:36,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:36,849 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:36,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:36,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:36,849 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 16:26:36,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:36,857 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:36,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:36,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:36,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:36,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 2520 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:36,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3150 backedges. 2520 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:38,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:38,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 73 [2018-12-03 16:26:38,405 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:38,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:26:38,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:26:38,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=3997, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:26:38,406 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 74 states. [2018-12-03 16:26:39,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:39,779 INFO L93 Difference]: Finished difference Result 337 states and 341 transitions. [2018-12-03 16:26:39,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:26:39,780 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 182 [2018-12-03 16:26:39,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:39,781 INFO L225 Difference]: With dead ends: 337 [2018-12-03 16:26:39,781 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 16:26:39,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 471 GetRequests, 292 SyntacticMatches, 71 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4340 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2809, Invalid=9181, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:26:39,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 16:26:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-03 16:26:39,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 16:26:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2018-12-03 16:26:39,799 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 182 [2018-12-03 16:26:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:39,799 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2018-12-03 16:26:39,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:26:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2018-12-03 16:26:39,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 16:26:39,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:39,800 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1, 1, 1, 1] [2018-12-03 16:26:39,800 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:39,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:39,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1595685335, now seen corresponding path program 70 times [2018-12-03 16:26:39,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:39,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:39,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:39,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:39,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 736 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:40,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:40,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:40,429 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:40,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:40,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:40,430 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 16:26:40,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:40,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:40,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:40,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 736 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:40,563 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:41,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 736 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:41,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:41,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2018-12-03 16:26:41,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:41,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:26:41,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:26:41,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:26:41,851 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 39 states. [2018-12-03 16:26:42,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:42,059 INFO L93 Difference]: Finished difference Result 200 states and 203 transitions. [2018-12-03 16:26:42,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:26:42,060 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 183 [2018-12-03 16:26:42,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:42,060 INFO L225 Difference]: With dead ends: 200 [2018-12-03 16:26:42,061 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 16:26:42,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 328 SyntacticMatches, 72 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:26:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 16:26:42,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2018-12-03 16:26:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 16:26:42,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 192 transitions. [2018-12-03 16:26:42,078 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 192 transitions. Word has length 183 [2018-12-03 16:26:42,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:42,078 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 192 transitions. [2018-12-03 16:26:42,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:26:42,078 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 192 transitions. [2018-12-03 16:26:42,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 16:26:42,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:42,079 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2018-12-03 16:26:42,079 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:42,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:42,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1835041505, now seen corresponding path program 71 times [2018-12-03 16:26:42,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:42,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:42,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:42,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:42,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:43,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3330 backedges. 2664 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:43,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:43,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:43,756 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:43,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:43,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:43,757 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 16:26:43,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:43,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:43,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 16:26:43,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:43,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3330 backedges. 2664 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:43,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3330 backedges. 2664 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:45,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:45,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 75 [2018-12-03 16:26:45,665 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:45,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:26:45,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:26:45,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4219, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:26:45,666 INFO L87 Difference]: Start difference. First operand 190 states and 192 transitions. Second operand 76 states. [2018-12-03 16:26:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:47,884 INFO L93 Difference]: Finished difference Result 346 states and 350 transitions. [2018-12-03 16:26:47,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:26:47,884 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 187 [2018-12-03 16:26:47,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:47,885 INFO L225 Difference]: With dead ends: 346 [2018-12-03 16:26:47,885 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 16:26:47,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 300 SyntacticMatches, 73 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4590 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2961, Invalid=9695, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 16:26:47,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 16:26:47,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-12-03 16:26:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-12-03 16:26:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 193 transitions. [2018-12-03 16:26:47,909 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 193 transitions. Word has length 187 [2018-12-03 16:26:47,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:47,909 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 193 transitions. [2018-12-03 16:26:47,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:26:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 193 transitions. [2018-12-03 16:26:47,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 16:26:47,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:47,911 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1, 1, 1, 1] [2018-12-03 16:26:47,911 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:47,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:47,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1521017350, now seen corresponding path program 72 times [2018-12-03 16:26:47,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:47,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:47,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:47,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:48,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 775 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:48,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:48,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:48,573 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:48,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:48,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:48,573 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 16:26:48,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:26:48,581 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:26:48,670 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:26:48,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:48,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 775 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:48,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:49,818 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 775 proven. 2592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:49,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:49,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 39 [2018-12-03 16:26:49,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:49,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:26:49,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:26:49,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:26:49,838 INFO L87 Difference]: Start difference. First operand 191 states and 193 transitions. Second operand 40 states. [2018-12-03 16:26:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:50,052 INFO L93 Difference]: Finished difference Result 205 states and 208 transitions. [2018-12-03 16:26:50,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:26:50,053 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 188 [2018-12-03 16:26:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:50,054 INFO L225 Difference]: With dead ends: 205 [2018-12-03 16:26:50,054 INFO L226 Difference]: Without dead ends: 199 [2018-12-03 16:26:50,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 337 SyntacticMatches, 74 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:26:50,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-12-03 16:26:50,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2018-12-03 16:26:50,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 16:26:50,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 197 transitions. [2018-12-03 16:26:50,076 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 197 transitions. Word has length 188 [2018-12-03 16:26:50,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:50,076 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 197 transitions. [2018-12-03 16:26:50,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:26:50,076 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 197 transitions. [2018-12-03 16:26:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 16:26:50,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:50,077 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2018-12-03 16:26:50,077 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:50,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:50,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1787388540, now seen corresponding path program 73 times [2018-12-03 16:26:50,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:50,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:50,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:50,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:50,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3515 backedges. 2812 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:52,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:52,090 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:52,090 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:52,090 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:52,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:52,090 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 16:26:52,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:52,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:26:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:52,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:52,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3515 backedges. 2812 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:52,222 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3515 backedges. 2812 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:53,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:53,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 77 [2018-12-03 16:26:53,852 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:53,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:26:53,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:26:53,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1559, Invalid=4447, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:26:53,853 INFO L87 Difference]: Start difference. First operand 195 states and 197 transitions. Second operand 78 states. [2018-12-03 16:26:55,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:55,815 INFO L93 Difference]: Finished difference Result 355 states and 359 transitions. [2018-12-03 16:26:55,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:26:55,815 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 192 [2018-12-03 16:26:55,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:55,816 INFO L225 Difference]: With dead ends: 355 [2018-12-03 16:26:55,816 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 16:26:55,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 308 SyntacticMatches, 75 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4847 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3117, Invalid=10223, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:26:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 16:26:55,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-03 16:26:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 16:26:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2018-12-03 16:26:55,839 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 192 [2018-12-03 16:26:55,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:55,840 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2018-12-03 16:26:55,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:26:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2018-12-03 16:26:55,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 16:26:55,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:55,841 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1, 1, 1, 1] [2018-12-03 16:26:55,841 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:55,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:55,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1861088757, now seen corresponding path program 74 times [2018-12-03 16:26:55,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:55,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:26:55,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:55,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:26:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 815 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:56,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:56,734 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:26:56,734 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:26:56,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:26:56,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:26:56,734 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 16:26:56,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:26:56,743 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:26:56,883 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:26:56,883 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:26:56,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:26:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 815 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:56,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:26:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 815 proven. 2738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:26:58,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:26:58,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2018-12-03 16:26:58,083 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:26:58,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:26:58,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:26:58,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:26:58,084 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 41 states. [2018-12-03 16:26:58,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:26:58,302 INFO L93 Difference]: Finished difference Result 210 states and 213 transitions. [2018-12-03 16:26:58,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:26:58,303 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 193 [2018-12-03 16:26:58,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:26:58,303 INFO L225 Difference]: With dead ends: 210 [2018-12-03 16:26:58,304 INFO L226 Difference]: Without dead ends: 204 [2018-12-03 16:26:58,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 346 SyntacticMatches, 76 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:26:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-03 16:26:58,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 200. [2018-12-03 16:26:58,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-03 16:26:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 202 transitions. [2018-12-03 16:26:58,322 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 202 transitions. Word has length 193 [2018-12-03 16:26:58,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:26:58,322 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 202 transitions. [2018-12-03 16:26:58,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:26:58,322 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 202 transitions. [2018-12-03 16:26:58,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 16:26:58,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:26:58,323 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2018-12-03 16:26:58,323 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:26:58,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:26:58,323 INFO L82 PathProgramCache]: Analyzing trace with hash -315300117, now seen corresponding path program 75 times [2018-12-03 16:26:58,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:26:58,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:58,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:26:58,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:26:58,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:26:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3705 backedges. 2964 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:00,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:00,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:00,080 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:00,080 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:00,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:00,081 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 16:27:00,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:00,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:00,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:00,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:00,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3705 backedges. 2964 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:00,221 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3705 backedges. 2964 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:02,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:02,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 79 [2018-12-03 16:27:02,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:02,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:27:02,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:27:02,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4681, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:27:02,191 INFO L87 Difference]: Start difference. First operand 200 states and 202 transitions. Second operand 80 states. [2018-12-03 16:27:04,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:04,475 INFO L93 Difference]: Finished difference Result 364 states and 368 transitions. [2018-12-03 16:27:04,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:27:04,475 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 197 [2018-12-03 16:27:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:04,476 INFO L225 Difference]: With dead ends: 364 [2018-12-03 16:27:04,476 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 16:27:04,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 316 SyntacticMatches, 77 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5111 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3277, Invalid=10765, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 16:27:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 16:27:04,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-12-03 16:27:04,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 16:27:04,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 203 transitions. [2018-12-03 16:27:04,502 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 203 transitions. Word has length 197 [2018-12-03 16:27:04,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:04,502 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 203 transitions. [2018-12-03 16:27:04,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:27:04,503 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 203 transitions. [2018-12-03 16:27:04,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 16:27:04,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:04,504 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1, 1, 1, 1] [2018-12-03 16:27:04,504 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:04,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:04,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1372678382, now seen corresponding path program 76 times [2018-12-03 16:27:04,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:04,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:04,505 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:04,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:04,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 856 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:05,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:05,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:05,259 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27: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 16:27:05,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:05,259 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 16:27:05,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:05,267 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:05,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 856 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:05,397 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 856 proven. 2888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:06,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:06,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 41 [2018-12-03 16:27:06,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:06,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:27:06,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:27:06,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:27:06,842 INFO L87 Difference]: Start difference. First operand 201 states and 203 transitions. Second operand 42 states. [2018-12-03 16:27:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:07,135 INFO L93 Difference]: Finished difference Result 215 states and 218 transitions. [2018-12-03 16:27:07,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:27:07,136 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 198 [2018-12-03 16:27:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:07,137 INFO L225 Difference]: With dead ends: 215 [2018-12-03 16:27:07,137 INFO L226 Difference]: Without dead ends: 209 [2018-12-03 16:27:07,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 355 SyntacticMatches, 78 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:27:07,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-03 16:27:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2018-12-03 16:27:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 16:27:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 207 transitions. [2018-12-03 16:27:07,162 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 207 transitions. Word has length 198 [2018-12-03 16:27:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:07,163 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 207 transitions. [2018-12-03 16:27:07,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:27:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 207 transitions. [2018-12-03 16:27:07,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-03 16:27:07,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:07,164 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 39, 1, 1, 1, 1, 1] [2018-12-03 16:27:07,164 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:07,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:07,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1792389512, now seen corresponding path program 77 times [2018-12-03 16:27:07,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:07,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:07,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:07,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:07,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 3900 backedges. 3120 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:09,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:09,076 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:09,076 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:09,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:09,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:09,077 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 16:27:09,085 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:09,085 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:09,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 16:27:09,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:09,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:09,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3900 backedges. 3120 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:09,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3900 backedges. 3120 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:11,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:11,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 81 [2018-12-03 16:27:11,037 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:11,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:27:11,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:27:11,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=4921, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:27:11,038 INFO L87 Difference]: Start difference. First operand 205 states and 207 transitions. Second operand 82 states. [2018-12-03 16:27:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:13,643 INFO L93 Difference]: Finished difference Result 373 states and 377 transitions. [2018-12-03 16:27:13,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:27:13,643 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 202 [2018-12-03 16:27:13,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:13,644 INFO L225 Difference]: With dead ends: 373 [2018-12-03 16:27:13,644 INFO L226 Difference]: Without dead ends: 206 [2018-12-03 16:27:13,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 324 SyntacticMatches, 79 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5382 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3441, Invalid=11321, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:27:13,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-03 16:27:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-12-03 16:27:13,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-03 16:27:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2018-12-03 16:27:13,671 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2018-12-03 16:27:13,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:13,671 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2018-12-03 16:27:13,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:27:13,671 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2018-12-03 16:27:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 16:27:13,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:13,673 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1, 1, 1, 1] [2018-12-03 16:27:13,673 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:13,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:13,673 INFO L82 PathProgramCache]: Analyzing trace with hash -185138751, now seen corresponding path program 78 times [2018-12-03 16:27:13,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:13,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:13,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:13,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:13,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 898 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:14,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:14,448 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:14,448 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:14,448 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:14,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:14,448 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 16:27:14,457 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:14,457 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:14,551 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:14,551 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:14,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:14,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 898 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:14,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 898 proven. 3042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:15,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:15,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2018-12-03 16:27:15,889 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:15,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:27:15,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:27:15,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:27:15,890 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 43 states. [2018-12-03 16:27:16,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:16,153 INFO L93 Difference]: Finished difference Result 220 states and 223 transitions. [2018-12-03 16:27:16,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:27:16,154 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 203 [2018-12-03 16:27:16,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:16,155 INFO L225 Difference]: With dead ends: 220 [2018-12-03 16:27:16,155 INFO L226 Difference]: Without dead ends: 214 [2018-12-03 16:27:16,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 364 SyntacticMatches, 80 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 16:27:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-12-03 16:27:16,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2018-12-03 16:27:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-03 16:27:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2018-12-03 16:27:16,183 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 203 [2018-12-03 16:27:16,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:16,183 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2018-12-03 16:27:16,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:27:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2018-12-03 16:27:16,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-03 16:27:16,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:16,184 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 40, 1, 1, 1, 1, 1] [2018-12-03 16:27:16,185 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:16,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:16,185 INFO L82 PathProgramCache]: Analyzing trace with hash -319083337, now seen corresponding path program 79 times [2018-12-03 16:27:16,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:16,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:16,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:16,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:16,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 4100 backedges. 3280 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:18,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:18,526 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:18,526 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:18,526 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:18,526 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:18,526 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 16:27:18,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:18,534 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:18,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:18,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4100 backedges. 3280 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:18,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:20,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4100 backedges. 3280 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:20,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:20,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 83 [2018-12-03 16:27:20,574 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:20,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 16:27:20,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 16:27:20,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1805, Invalid=5167, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:27:20,576 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 84 states. [2018-12-03 16:27:22,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:22,812 INFO L93 Difference]: Finished difference Result 382 states and 386 transitions. [2018-12-03 16:27:22,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:27:22,813 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 207 [2018-12-03 16:27:22,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:22,814 INFO L225 Difference]: With dead ends: 382 [2018-12-03 16:27:22,814 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 16:27:22,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 332 SyntacticMatches, 81 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5660 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3609, Invalid=11891, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 16:27:22,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 16:27:22,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-03 16:27:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 16:27:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 213 transitions. [2018-12-03 16:27:22,834 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 213 transitions. Word has length 207 [2018-12-03 16:27:22,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:22,834 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 213 transitions. [2018-12-03 16:27:22,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 16:27:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 213 transitions. [2018-12-03 16:27:22,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-03 16:27:22,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:22,835 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1, 1, 1, 1] [2018-12-03 16:27:22,835 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:22,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1953503262, now seen corresponding path program 80 times [2018-12-03 16:27:22,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:22,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:22,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:22,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:22,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:23,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 941 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:23,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:23,689 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:23,689 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:23,690 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:23,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:23,690 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 16:27:23,699 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:23,699 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:23,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 16:27:23,854 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:23,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:23,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 941 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:23,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 941 proven. 3200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:25,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:25,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 43 [2018-12-03 16:27:25,248 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:25,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:27:25,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:27:25,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:27:25,248 INFO L87 Difference]: Start difference. First operand 211 states and 213 transitions. Second operand 44 states. [2018-12-03 16:27:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:25,481 INFO L93 Difference]: Finished difference Result 225 states and 228 transitions. [2018-12-03 16:27:25,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:27:25,482 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 208 [2018-12-03 16:27:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:25,483 INFO L225 Difference]: With dead ends: 225 [2018-12-03 16:27:25,483 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 16:27:25,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 373 SyntacticMatches, 82 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1681 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:27:25,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 16:27:25,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2018-12-03 16:27:25,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-12-03 16:27:25,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 217 transitions. [2018-12-03 16:27:25,503 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 217 transitions. Word has length 208 [2018-12-03 16:27:25,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:25,504 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 217 transitions. [2018-12-03 16:27:25,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:27:25,504 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 217 transitions. [2018-12-03 16:27:25,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-03 16:27:25,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:25,505 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 41, 1, 1, 1, 1, 1] [2018-12-03 16:27:25,505 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:25,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:25,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1125633172, now seen corresponding path program 81 times [2018-12-03 16:27:25,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:25,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:25,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:25,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:25,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:27,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4305 backedges. 3444 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:27,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:27,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:27,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:27,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:27,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:27,794 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 16:27:27,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:27,803 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:27,904 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:27,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:27,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4305 backedges. 3444 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:27,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4305 backedges. 3444 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:29,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:29,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 85 [2018-12-03 16:27:29,918 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:29,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 16:27:29,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 16:27:29,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5419, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:27:29,919 INFO L87 Difference]: Start difference. First operand 215 states and 217 transitions. Second operand 86 states. [2018-12-03 16:27:32,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:32,329 INFO L93 Difference]: Finished difference Result 391 states and 395 transitions. [2018-12-03 16:27:32,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:27:32,330 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 212 [2018-12-03 16:27:32,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:32,331 INFO L225 Difference]: With dead ends: 391 [2018-12-03 16:27:32,331 INFO L226 Difference]: Without dead ends: 216 [2018-12-03 16:27:32,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 340 SyntacticMatches, 83 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5945 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=3781, Invalid=12475, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:27:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-12-03 16:27:32,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-12-03 16:27:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-12-03 16:27:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 218 transitions. [2018-12-03 16:27:32,353 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 218 transitions. Word has length 212 [2018-12-03 16:27:32,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:32,353 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 218 transitions. [2018-12-03 16:27:32,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 16:27:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 218 transitions. [2018-12-03 16:27:32,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-03 16:27:32,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:32,355 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1, 1, 1, 1] [2018-12-03 16:27:32,355 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:32,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:32,355 INFO L82 PathProgramCache]: Analyzing trace with hash -155129459, now seen corresponding path program 82 times [2018-12-03 16:27:32,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:32,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:32,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:32,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:32,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:33,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 985 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:33,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:33,153 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:33,153 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:33,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:33,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:33,153 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 16:27:33,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:33,163 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:33,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:33,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 985 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:33,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 985 proven. 3362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:34,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:34,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2018-12-03 16:27:34,680 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:34,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:27:34,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:27:34,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 16:27:34,681 INFO L87 Difference]: Start difference. First operand 216 states and 218 transitions. Second operand 45 states. [2018-12-03 16:27:34,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:34,950 INFO L93 Difference]: Finished difference Result 230 states and 233 transitions. [2018-12-03 16:27:34,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:27:34,950 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 213 [2018-12-03 16:27:34,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:34,951 INFO L225 Difference]: With dead ends: 230 [2018-12-03 16:27:34,951 INFO L226 Difference]: Without dead ends: 224 [2018-12-03 16:27:34,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 382 SyntacticMatches, 84 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1764 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 16:27:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-12-03 16:27:34,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 220. [2018-12-03 16:27:34,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-03 16:27:34,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-12-03 16:27:34,973 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 213 [2018-12-03 16:27:34,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:34,973 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-12-03 16:27:34,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:27:34,973 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-12-03 16:27:34,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-12-03 16:27:34,974 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:34,974 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 42, 42, 42, 1, 1, 1, 1, 1] [2018-12-03 16:27:34,975 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:34,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:34,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1531687293, now seen corresponding path program 83 times [2018-12-03 16:27:34,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:34,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:34,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:34,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:34,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:37,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4515 backedges. 3612 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:37,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:37,516 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:37,516 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:37,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:37,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:37,516 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 16:27:37,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:37,525 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:37,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 16:27:37,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:37,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 4515 backedges. 3612 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:37,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:39,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4515 backedges. 3612 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:39,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:39,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 87 [2018-12-03 16:27:39,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:39,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:27:39,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:27:39,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1979, Invalid=5677, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:27:39,820 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 88 states. [2018-12-03 16:27:41,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:41,952 INFO L93 Difference]: Finished difference Result 400 states and 404 transitions. [2018-12-03 16:27:41,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:27:41,952 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 217 [2018-12-03 16:27:41,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:41,953 INFO L225 Difference]: With dead ends: 400 [2018-12-03 16:27:41,953 INFO L226 Difference]: Without dead ends: 221 [2018-12-03 16:27:41,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 348 SyntacticMatches, 85 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6237 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=3957, Invalid=13073, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 16:27:41,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-03 16:27:41,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-12-03 16:27:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-03 16:27:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 223 transitions. [2018-12-03 16:27:41,975 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 223 transitions. Word has length 217 [2018-12-03 16:27:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:41,975 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 223 transitions. [2018-12-03 16:27:41,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:27:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 223 transitions. [2018-12-03 16:27:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-03 16:27:41,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:41,976 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1, 1, 1, 1] [2018-12-03 16:27:41,976 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:41,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:41,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1128490282, now seen corresponding path program 84 times [2018-12-03 16:27:41,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:41,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:41,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:41,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:41,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:42,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:43,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 1030 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:43,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:43,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:43,096 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:43,096 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:43,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:43,096 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 16:27:43,107 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:43,107 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:43,211 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:43,211 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:43,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:43,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 1030 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:43,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:44,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 1030 proven. 3528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:44,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:44,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 45 [2018-12-03 16:27:44,677 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:44,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:27:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:27:44,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:27:44,678 INFO L87 Difference]: Start difference. First operand 221 states and 223 transitions. Second operand 46 states. [2018-12-03 16:27:44,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:44,951 INFO L93 Difference]: Finished difference Result 235 states and 238 transitions. [2018-12-03 16:27:44,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:27:44,951 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 218 [2018-12-03 16:27:44,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:44,952 INFO L225 Difference]: With dead ends: 235 [2018-12-03 16:27:44,952 INFO L226 Difference]: Without dead ends: 229 [2018-12-03 16:27:44,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 391 SyntacticMatches, 86 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1849 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:27:44,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-03 16:27:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 225. [2018-12-03 16:27:44,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-03 16:27:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 227 transitions. [2018-12-03 16:27:44,974 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 227 transitions. Word has length 218 [2018-12-03 16:27:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:44,975 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 227 transitions. [2018-12-03 16:27:44,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:27:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 227 transitions. [2018-12-03 16:27:44,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-03 16:27:44,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:44,976 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 43, 1, 1, 1, 1, 1] [2018-12-03 16:27:44,976 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:44,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:44,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1373260896, now seen corresponding path program 85 times [2018-12-03 16:27:44,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:44,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:44,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:44,977 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:47,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4730 backedges. 3784 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:47,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:47,456 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:47,456 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:47,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:47,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:47,456 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 16:27:47,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:47,465 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:27:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:47,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:47,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4730 backedges. 3784 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:47,608 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4730 backedges. 3784 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:49,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:49,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 89 [2018-12-03 16:27:49,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:49,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:27:49,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:27:49,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2069, Invalid=5941, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:27:49,749 INFO L87 Difference]: Start difference. First operand 225 states and 227 transitions. Second operand 90 states. [2018-12-03 16:27:52,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:52,838 INFO L93 Difference]: Finished difference Result 409 states and 413 transitions. [2018-12-03 16:27:52,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 16:27:52,838 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 222 [2018-12-03 16:27:52,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:52,839 INFO L225 Difference]: With dead ends: 409 [2018-12-03 16:27:52,839 INFO L226 Difference]: Without dead ends: 226 [2018-12-03 16:27:52,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 575 GetRequests, 356 SyntacticMatches, 87 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6536 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4137, Invalid=13685, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:27:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-03 16:27:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-12-03 16:27:52,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-03 16:27:52,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 228 transitions. [2018-12-03 16:27:52,862 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 228 transitions. Word has length 222 [2018-12-03 16:27:52,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:52,862 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 228 transitions. [2018-12-03 16:27:52,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:27:52,862 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 228 transitions. [2018-12-03 16:27:52,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-12-03 16:27:52,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:52,863 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1, 1, 1, 1] [2018-12-03 16:27:52,863 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:52,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:52,863 INFO L82 PathProgramCache]: Analyzing trace with hash 2022550873, now seen corresponding path program 86 times [2018-12-03 16:27:52,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:52,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:52,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:27:52,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:52,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:53,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 1076 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:53,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:53,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:53,823 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:53,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:53,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:53,823 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 16:27:53,831 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:27:53,831 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:27:54,006 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 16:27:54,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:54,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 1076 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:54,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:27:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 1076 proven. 3698 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:55,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:27:55,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2018-12-03 16:27:55,577 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:27:55,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:27:55,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:27:55,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:27:55,578 INFO L87 Difference]: Start difference. First operand 226 states and 228 transitions. Second operand 47 states. [2018-12-03 16:27:55,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:27:55,869 INFO L93 Difference]: Finished difference Result 240 states and 243 transitions. [2018-12-03 16:27:55,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:27:55,869 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 223 [2018-12-03 16:27:55,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:27:55,870 INFO L225 Difference]: With dead ends: 240 [2018-12-03 16:27:55,870 INFO L226 Difference]: Without dead ends: 234 [2018-12-03 16:27:55,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 400 SyntacticMatches, 88 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:27:55,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-03 16:27:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 230. [2018-12-03 16:27:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-12-03 16:27:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 232 transitions. [2018-12-03 16:27:55,893 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 232 transitions. Word has length 223 [2018-12-03 16:27:55,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:27:55,893 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 232 transitions. [2018-12-03 16:27:55,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:27:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 232 transitions. [2018-12-03 16:27:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-12-03 16:27:55,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:27:55,894 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 44, 44, 44, 1, 1, 1, 1, 1] [2018-12-03 16:27:55,894 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:27:55,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:27:55,894 INFO L82 PathProgramCache]: Analyzing trace with hash 664947791, now seen corresponding path program 87 times [2018-12-03 16:27:55,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:27:55,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:55,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:27:55,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:27:55,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:27:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:27:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 3960 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:58,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:58,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:27:58,528 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:27:58,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:27:58,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:27:58,528 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 16:27:58,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:27:58,538 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:27:58,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:27:58,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:27:58,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:27:58,694 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 3960 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:27:58,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:00,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 3960 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:00,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:00,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 91 [2018-12-03 16:28:00,961 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:00,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 16:28:00,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 16:28:00,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6211, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:28:00,962 INFO L87 Difference]: Start difference. First operand 230 states and 232 transitions. Second operand 92 states. [2018-12-03 16:28:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:04,246 INFO L93 Difference]: Finished difference Result 418 states and 422 transitions. [2018-12-03 16:28:04,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 16:28:04,246 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 227 [2018-12-03 16:28:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:04,247 INFO L225 Difference]: With dead ends: 418 [2018-12-03 16:28:04,247 INFO L226 Difference]: Without dead ends: 231 [2018-12-03 16:28:04,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 364 SyntacticMatches, 89 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6842 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=4321, Invalid=14311, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 16:28:04,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-12-03 16:28:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-12-03 16:28:04,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-03 16:28:04,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2018-12-03 16:28:04,270 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 227 [2018-12-03 16:28:04,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:04,271 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2018-12-03 16:28:04,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 16:28:04,271 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2018-12-03 16:28:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-03 16:28:04,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:04,272 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1, 1, 1, 1] [2018-12-03 16:28:04,272 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:04,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:04,272 INFO L82 PathProgramCache]: Analyzing trace with hash -402751946, now seen corresponding path program 88 times [2018-12-03 16:28:04,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:04,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:04,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:04,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:04,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:05,210 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 1123 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:05,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:05,211 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:05,211 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:05,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:05,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:05,211 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 16:28:05,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:05,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:05,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 1123 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:05,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:06,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 1123 proven. 3872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:06,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:06,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 47 [2018-12-03 16:28:06,925 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:06,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:28:06,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:28:06,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:28:06,926 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 48 states. [2018-12-03 16:28:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:07,229 INFO L93 Difference]: Finished difference Result 245 states and 248 transitions. [2018-12-03 16:28:07,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:28:07,229 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 228 [2018-12-03 16:28:07,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:07,230 INFO L225 Difference]: With dead ends: 245 [2018-12-03 16:28:07,231 INFO L226 Difference]: Without dead ends: 239 [2018-12-03 16:28:07,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 409 SyntacticMatches, 90 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2025 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:28:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-03 16:28:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 235. [2018-12-03 16:28:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-03 16:28:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 237 transitions. [2018-12-03 16:28:07,260 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 237 transitions. Word has length 228 [2018-12-03 16:28:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:07,260 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 237 transitions. [2018-12-03 16:28:07,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:28:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 237 transitions. [2018-12-03 16:28:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-03 16:28:07,261 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:07,262 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 45, 1, 1, 1, 1, 1] [2018-12-03 16:28:07,262 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:07,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:07,262 INFO L82 PathProgramCache]: Analyzing trace with hash -564828500, now seen corresponding path program 89 times [2018-12-03 16:28:07,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:07,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:07,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:07,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:07,263 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:09,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5175 backedges. 4140 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:09,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:09,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:09,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:09,960 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:09,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:09,960 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 16:28:09,969 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:09,969 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:10,151 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 16:28:10,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:10,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:10,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5175 backedges. 4140 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:10,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5175 backedges. 4140 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:12,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:12,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 93 [2018-12-03 16:28:12,539 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:12,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:28:12,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:28:12,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:28:12,540 INFO L87 Difference]: Start difference. First operand 235 states and 237 transitions. Second operand 94 states. [2018-12-03 16:28:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:15,678 INFO L93 Difference]: Finished difference Result 427 states and 431 transitions. [2018-12-03 16:28:15,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:28:15,678 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 232 [2018-12-03 16:28:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:15,679 INFO L225 Difference]: With dead ends: 427 [2018-12-03 16:28:15,679 INFO L226 Difference]: Without dead ends: 236 [2018-12-03 16:28:15,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 372 SyntacticMatches, 91 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7155 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=4509, Invalid=14951, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:28:15,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-12-03 16:28:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-12-03 16:28:15,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-12-03 16:28:15,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 238 transitions. [2018-12-03 16:28:15,708 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 238 transitions. Word has length 232 [2018-12-03 16:28:15,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:15,708 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 238 transitions. [2018-12-03 16:28:15,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:28:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 238 transitions. [2018-12-03 16:28:15,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-12-03 16:28:15,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:15,709 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1, 1, 1, 1] [2018-12-03 16:28:15,709 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:15,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:15,710 INFO L82 PathProgramCache]: Analyzing trace with hash 522145061, now seen corresponding path program 90 times [2018-12-03 16:28:15,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:15,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:15,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:15,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:15,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:15,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:16,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 1171 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:16,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:16,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:16,670 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:16,670 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:16,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:16,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 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 16:28:16,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:16,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:16,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:16,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:16,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 1171 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:16,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:18,744 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 1171 proven. 4050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:18,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:18,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2018-12-03 16:28:18,763 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:18,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:28:18,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:28:18,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:28:18,764 INFO L87 Difference]: Start difference. First operand 236 states and 238 transitions. Second operand 49 states. [2018-12-03 16:28:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:19,058 INFO L93 Difference]: Finished difference Result 250 states and 253 transitions. [2018-12-03 16:28:19,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:28:19,065 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 233 [2018-12-03 16:28:19,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:19,066 INFO L225 Difference]: With dead ends: 250 [2018-12-03 16:28:19,066 INFO L226 Difference]: Without dead ends: 244 [2018-12-03 16:28:19,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 557 GetRequests, 418 SyntacticMatches, 92 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:28:19,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-12-03 16:28:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 240. [2018-12-03 16:28:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-12-03 16:28:19,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 242 transitions. [2018-12-03 16:28:19,093 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 242 transitions. Word has length 233 [2018-12-03 16:28:19,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:19,093 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 242 transitions. [2018-12-03 16:28:19,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:28:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 242 transitions. [2018-12-03 16:28:19,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-03 16:28:19,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:19,094 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 46, 46, 46, 1, 1, 1, 1, 1] [2018-12-03 16:28:19,095 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:19,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:19,095 INFO L82 PathProgramCache]: Analyzing trace with hash -377018853, now seen corresponding path program 91 times [2018-12-03 16:28:19,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:19,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:19,096 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:19,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:19,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:19,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:22,104 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 4324 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:22,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:22,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:22,104 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:22,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:22,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:22,105 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 16:28:22,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:22,114 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:22,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:22,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 4324 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:22,276 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 4324 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:25,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:25,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 95 [2018-12-03 16:28:25,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:25,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 16:28:25,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 16:28:25,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:28:25,050 INFO L87 Difference]: Start difference. First operand 240 states and 242 transitions. Second operand 96 states. [2018-12-03 16:28:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:28,605 INFO L93 Difference]: Finished difference Result 436 states and 440 transitions. [2018-12-03 16:28:28,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 16:28:28,605 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 237 [2018-12-03 16:28:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:28,606 INFO L225 Difference]: With dead ends: 436 [2018-12-03 16:28:28,607 INFO L226 Difference]: Without dead ends: 241 [2018-12-03 16:28:28,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 380 SyntacticMatches, 93 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7475 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=4701, Invalid=15605, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 16:28:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-12-03 16:28:28,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-12-03 16:28:28,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-03 16:28:28,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2018-12-03 16:28:28,631 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 237 [2018-12-03 16:28:28,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:28,632 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2018-12-03 16:28:28,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 16:28:28,632 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2018-12-03 16:28:28,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-12-03 16:28:28,633 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:28,633 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1, 1, 1, 1] [2018-12-03 16:28:28,633 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:28,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:28,633 INFO L82 PathProgramCache]: Analyzing trace with hash 125264706, now seen corresponding path program 92 times [2018-12-03 16:28:28,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:28,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:28,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:28,634 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:29,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 1220 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:29,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:29,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:29,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:29,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 16:28:29,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:29,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 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 16:28:29,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:29,651 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:29,841 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 16:28:29,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:29,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:29,895 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 1220 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:29,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 1220 proven. 4232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:31,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:31,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 49 [2018-12-03 16:28:31,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:31,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:28:31,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:28:31,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:28:31,617 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 50 states. [2018-12-03 16:28:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:31,893 INFO L93 Difference]: Finished difference Result 255 states and 258 transitions. [2018-12-03 16:28:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:28:31,893 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 238 [2018-12-03 16:28:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:31,895 INFO L225 Difference]: With dead ends: 255 [2018-12-03 16:28:31,895 INFO L226 Difference]: Without dead ends: 249 [2018-12-03 16:28:31,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 427 SyntacticMatches, 94 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:28:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-12-03 16:28:31,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 245. [2018-12-03 16:28:31,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-03 16:28:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2018-12-03 16:28:31,923 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 238 [2018-12-03 16:28:31,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:31,924 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2018-12-03 16:28:31,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:28:31,924 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2018-12-03 16:28:31,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-12-03 16:28:31,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:31,925 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 47, 1, 1, 1, 1, 1] [2018-12-03 16:28:31,926 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:31,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:31,926 INFO L82 PathProgramCache]: Analyzing trace with hash 494724536, now seen corresponding path program 93 times [2018-12-03 16:28:31,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:31,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:31,927 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:31,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:31,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 5640 backedges. 4512 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:34,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:34,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:34,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:34,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:34,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:34,872 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 16:28:34,880 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:34,880 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:34,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:34,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:35,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5640 backedges. 4512 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:35,050 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:37,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5640 backedges. 4512 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:37,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:37,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 97 [2018-12-03 16:28:37,640 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:37,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 16:28:37,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 16:28:37,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=7057, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:28:37,641 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 98 states. [2018-12-03 16:28:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:40,228 INFO L93 Difference]: Finished difference Result 445 states and 449 transitions. [2018-12-03 16:28:40,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 16:28:40,228 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 242 [2018-12-03 16:28:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:40,229 INFO L225 Difference]: With dead ends: 445 [2018-12-03 16:28:40,229 INFO L226 Difference]: Without dead ends: 246 [2018-12-03 16:28:40,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 388 SyntacticMatches, 95 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7802 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=4897, Invalid=16273, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:28:40,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-12-03 16:28:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-12-03 16:28:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-12-03 16:28:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 248 transitions. [2018-12-03 16:28:40,264 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 248 transitions. Word has length 242 [2018-12-03 16:28:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:40,265 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 248 transitions. [2018-12-03 16:28:40,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 16:28:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 248 transitions. [2018-12-03 16:28:40,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-03 16:28:40,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:40,266 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1, 1, 1, 1] [2018-12-03 16:28:40,266 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:40,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:40,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1883780879, now seen corresponding path program 94 times [2018-12-03 16:28:40,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:40,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:40,267 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:40,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:40,268 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:41,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 1270 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:41,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:41,312 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:41,312 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:41,312 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:41,312 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:41,312 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 16:28:41,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:41,322 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:28:41,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:41,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 1270 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:41,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:43,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 1270 proven. 4418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:43,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:43,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2018-12-03 16:28:43,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:43,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:28:43,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:28:43,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:28:43,282 INFO L87 Difference]: Start difference. First operand 246 states and 248 transitions. Second operand 51 states. [2018-12-03 16:28:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:43,625 INFO L93 Difference]: Finished difference Result 260 states and 263 transitions. [2018-12-03 16:28:43,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:28:43,626 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 243 [2018-12-03 16:28:43,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:43,627 INFO L225 Difference]: With dead ends: 260 [2018-12-03 16:28:43,627 INFO L226 Difference]: Without dead ends: 254 [2018-12-03 16:28:43,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 436 SyntacticMatches, 96 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2304 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:28:43,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-03 16:28:43,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2018-12-03 16:28:43,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-12-03 16:28:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 252 transitions. [2018-12-03 16:28:43,652 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 252 transitions. Word has length 243 [2018-12-03 16:28:43,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:43,653 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 252 transitions. [2018-12-03 16:28:43,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:28:43,653 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 252 transitions. [2018-12-03 16:28:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-12-03 16:28:43,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:43,654 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 48, 48, 48, 1, 1, 1, 1, 1] [2018-12-03 16:28:43,654 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:43,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:43,654 INFO L82 PathProgramCache]: Analyzing trace with hash 514120679, now seen corresponding path program 95 times [2018-12-03 16:28:43,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:43,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:43,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:28:43,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:43,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:46,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5880 backedges. 4704 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:46,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:46,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:46,472 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:46,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:28:46,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:46,473 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 16:28:46,481 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:28:46,481 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:28:46,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 16:28:46,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:46,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5880 backedges. 4704 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:46,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:49,598 INFO L134 CoverageAnalysis]: Checked inductivity of 5880 backedges. 4704 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:49,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:49,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 99 [2018-12-03 16:28:49,618 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:49,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 16:28:49,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 16:28:49,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2549, Invalid=7351, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:28:49,619 INFO L87 Difference]: Start difference. First operand 250 states and 252 transitions. Second operand 100 states. [2018-12-03 16:28:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:53,100 INFO L93 Difference]: Finished difference Result 454 states and 458 transitions. [2018-12-03 16:28:53,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 16:28:53,100 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 247 [2018-12-03 16:28:53,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:53,101 INFO L225 Difference]: With dead ends: 454 [2018-12-03 16:28:53,101 INFO L226 Difference]: Without dead ends: 251 [2018-12-03 16:28:53,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 396 SyntacticMatches, 97 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8136 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=5097, Invalid=16955, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 16:28:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-03 16:28:53,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-12-03 16:28:53,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-03 16:28:53,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 253 transitions. [2018-12-03 16:28:53,130 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 253 transitions. Word has length 247 [2018-12-03 16:28:53,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:53,130 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 253 transitions. [2018-12-03 16:28:53,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 16:28:53,130 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 253 transitions. [2018-12-03 16:28:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-03 16:28:53,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:53,131 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1, 1, 1, 1] [2018-12-03 16:28:53,131 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:53,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:53,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1107028914, now seen corresponding path program 96 times [2018-12-03 16:28:53,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:53,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:53,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:53,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:53,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:28:54,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 1321 proven. 4608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:54,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:54,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:28:54,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:28:54,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 16:28:54,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:28:54,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 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 16:28:54,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:28:54,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:28:54,609 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:28:54,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:28:54,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:28:54,668 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 1321 proven. 4608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:54,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:28:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 1321 proven. 4608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:28:56,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:28:56,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 16:28:56,571 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:28:56,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:28:56,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:28:56,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:28:56,572 INFO L87 Difference]: Start difference. First operand 251 states and 253 transitions. Second operand 52 states. [2018-12-03 16:28:56,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:28:56,876 INFO L93 Difference]: Finished difference Result 265 states and 268 transitions. [2018-12-03 16:28:56,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:28:56,877 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 248 [2018-12-03 16:28:56,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:28:56,878 INFO L225 Difference]: With dead ends: 265 [2018-12-03 16:28:56,878 INFO L226 Difference]: Without dead ends: 259 [2018-12-03 16:28:56,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 445 SyntacticMatches, 98 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2401 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:28:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-03 16:28:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 255. [2018-12-03 16:28:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-03 16:28:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2018-12-03 16:28:56,904 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 248 [2018-12-03 16:28:56,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:28:56,904 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2018-12-03 16:28:56,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:28:56,904 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2018-12-03 16:28:56,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-03 16:28:56,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:28:56,905 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 49, 1, 1, 1, 1, 1] [2018-12-03 16:28:56,905 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:28:56,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:28:56,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1827811524, now seen corresponding path program 97 times [2018-12-03 16:28:56,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:28:56,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:56,906 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:28:56,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:28:56,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:28:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:00,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6125 backedges. 4900 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:00,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:00,083 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:00,083 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:00,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:00,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:00,083 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 16:29:00,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:00,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:00,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:00,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 6125 backedges. 4900 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:00,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 6125 backedges. 4900 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:02,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:02,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 101 [2018-12-03 16:29:02,999 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:03,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 16:29:03,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 16:29:03,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2651, Invalid=7651, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:29:03,001 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 102 states. [2018-12-03 16:29:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:06,828 INFO L93 Difference]: Finished difference Result 463 states and 467 transitions. [2018-12-03 16:29:06,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 16:29:06,828 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 252 [2018-12-03 16:29:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:06,829 INFO L225 Difference]: With dead ends: 463 [2018-12-03 16:29:06,830 INFO L226 Difference]: Without dead ends: 256 [2018-12-03 16:29:06,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 404 SyntacticMatches, 99 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8477 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=5301, Invalid=17651, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:29:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-12-03 16:29:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-12-03 16:29:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-03 16:29:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 258 transitions. [2018-12-03 16:29:06,861 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 258 transitions. Word has length 252 [2018-12-03 16:29:06,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:06,861 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 258 transitions. [2018-12-03 16:29:06,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 16:29:06,861 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 258 transitions. [2018-12-03 16:29:06,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-12-03 16:29:06,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:06,863 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1, 1, 1, 1] [2018-12-03 16:29:06,863 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:06,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:06,863 INFO L82 PathProgramCache]: Analyzing trace with hash -803659587, now seen corresponding path program 98 times [2018-12-03 16:29:06,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:06,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:06,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:06,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:06,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:07,984 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 1373 proven. 4802 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:07,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:07,984 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:07,984 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:07,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:07,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:07,985 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 16:29:07,996 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:07,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:08,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 16:29:08,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:08,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:08,265 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 1373 proven. 4802 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:08,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:10,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 1373 proven. 4802 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:10,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:10,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-03 16:29:10,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:10,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:29:10,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:29:10,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:29:10,420 INFO L87 Difference]: Start difference. First operand 256 states and 258 transitions. Second operand 53 states. [2018-12-03 16:29:10,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:10,782 INFO L93 Difference]: Finished difference Result 270 states and 273 transitions. [2018-12-03 16:29:10,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:29:10,782 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 253 [2018-12-03 16:29:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:10,783 INFO L225 Difference]: With dead ends: 270 [2018-12-03 16:29:10,784 INFO L226 Difference]: Without dead ends: 264 [2018-12-03 16:29:10,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 454 SyntacticMatches, 100 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2500 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:29:10,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-03 16:29:10,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 260. [2018-12-03 16:29:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-12-03 16:29:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 262 transitions. [2018-12-03 16:29:10,815 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 262 transitions. Word has length 253 [2018-12-03 16:29:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:10,816 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 262 transitions. [2018-12-03 16:29:10,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:29:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 262 transitions. [2018-12-03 16:29:10,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-12-03 16:29:10,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:10,817 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 50, 50, 50, 1, 1, 1, 1, 1] [2018-12-03 16:29:10,817 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:10,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:10,817 INFO L82 PathProgramCache]: Analyzing trace with hash 465399219, now seen corresponding path program 99 times [2018-12-03 16:29:10,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:10,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:10,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:10,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:10,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:10,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6375 backedges. 5100 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:13,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:13,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:13,888 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:13,888 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:13,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:13,888 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 16:29:13,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:13,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:14,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:14,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:14,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6375 backedges. 5100 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:14,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:17,162 INFO L134 CoverageAnalysis]: Checked inductivity of 6375 backedges. 5100 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:17,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:17,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 103 [2018-12-03 16:29:17,182 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:17,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 16:29:17,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 16:29:17,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=7957, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:29:17,183 INFO L87 Difference]: Start difference. First operand 260 states and 262 transitions. Second operand 104 states. [2018-12-03 16:29:21,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:21,126 INFO L93 Difference]: Finished difference Result 472 states and 476 transitions. [2018-12-03 16:29:21,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 16:29:21,126 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 257 [2018-12-03 16:29:21,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:21,127 INFO L225 Difference]: With dead ends: 472 [2018-12-03 16:29:21,127 INFO L226 Difference]: Without dead ends: 261 [2018-12-03 16:29:21,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 666 GetRequests, 412 SyntacticMatches, 101 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8825 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=5509, Invalid=18361, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 16:29:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-12-03 16:29:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-12-03 16:29:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-12-03 16:29:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 263 transitions. [2018-12-03 16:29:21,155 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 263 transitions. Word has length 257 [2018-12-03 16:29:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:21,156 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 263 transitions. [2018-12-03 16:29:21,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 16:29:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 263 transitions. [2018-12-03 16:29:21,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-03 16:29:21,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:21,157 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1, 1, 1, 1] [2018-12-03 16:29:21,157 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:21,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:21,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1064997210, now seen corresponding path program 100 times [2018-12-03 16:29:21,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:21,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:21,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:21,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:22,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 1426 proven. 5000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:22,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:22,344 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:22,344 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:22,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:22,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:22,344 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 16:29:22,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:22,352 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:22,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:22,525 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 1426 proven. 5000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:22,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 1426 proven. 5000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:24,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:24,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 53 [2018-12-03 16:29:24,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:24,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:29:24,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:29:24,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:29:24,596 INFO L87 Difference]: Start difference. First operand 261 states and 263 transitions. Second operand 54 states. [2018-12-03 16:29:25,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:25,003 INFO L93 Difference]: Finished difference Result 275 states and 278 transitions. [2018-12-03 16:29:25,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:29:25,004 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 258 [2018-12-03 16:29:25,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:25,004 INFO L225 Difference]: With dead ends: 275 [2018-12-03 16:29:25,004 INFO L226 Difference]: Without dead ends: 269 [2018-12-03 16:29:25,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 463 SyntacticMatches, 102 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2601 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:29:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-12-03 16:29:25,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 265. [2018-12-03 16:29:25,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-03 16:29:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 267 transitions. [2018-12-03 16:29:25,034 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 267 transitions. Word has length 258 [2018-12-03 16:29:25,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:25,034 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 267 transitions. [2018-12-03 16:29:25,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:29:25,034 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 267 transitions. [2018-12-03 16:29:25,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-12-03 16:29:25,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:25,035 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 51, 1, 1, 1, 1, 1] [2018-12-03 16:29:25,035 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:25,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:25,036 INFO L82 PathProgramCache]: Analyzing trace with hash 629884880, now seen corresponding path program 101 times [2018-12-03 16:29:25,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:25,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:25,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:25,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:25,037 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 6630 backedges. 5304 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:28,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:28,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:28,218 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:28,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:28,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:28,218 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 16:29:28,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:28,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:28,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 16:29:28,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:28,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6630 backedges. 5304 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:28,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:31,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6630 backedges. 5304 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:31,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:31,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 105 [2018-12-03 16:29:31,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:31,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 16:29:31,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 16:29:31,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8269, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:29:31,743 INFO L87 Difference]: Start difference. First operand 265 states and 267 transitions. Second operand 106 states. [2018-12-03 16:29:36,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:36,068 INFO L93 Difference]: Finished difference Result 481 states and 485 transitions. [2018-12-03 16:29:36,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 16:29:36,068 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 262 [2018-12-03 16:29:36,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:36,069 INFO L225 Difference]: With dead ends: 481 [2018-12-03 16:29:36,069 INFO L226 Difference]: Without dead ends: 266 [2018-12-03 16:29:36,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 679 GetRequests, 420 SyntacticMatches, 103 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9180 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=5721, Invalid=19085, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:29:36,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-03 16:29:36,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2018-12-03 16:29:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-03 16:29:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 268 transitions. [2018-12-03 16:29:36,101 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 268 transitions. Word has length 262 [2018-12-03 16:29:36,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:36,101 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 268 transitions. [2018-12-03 16:29:36,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 16:29:36,101 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 268 transitions. [2018-12-03 16:29:36,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-12-03 16:29:36,102 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:36,102 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1, 1, 1, 1] [2018-12-03 16:29:36,102 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:36,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:36,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1501211511, now seen corresponding path program 102 times [2018-12-03 16:29:36,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:36,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:36,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:36,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:36,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:37,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6682 backedges. 1480 proven. 5202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:37,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:37,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:37,330 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:37,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:37,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:37,330 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 16:29:37,338 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:37,339 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:37,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:37,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:37,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6682 backedges. 1480 proven. 5202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:37,527 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 6682 backedges. 1480 proven. 5202 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:39,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:39,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2018-12-03 16:29:39,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:39,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:29:39,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:29:39,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:29:39,558 INFO L87 Difference]: Start difference. First operand 266 states and 268 transitions. Second operand 55 states. [2018-12-03 16:29:39,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:39,905 INFO L93 Difference]: Finished difference Result 280 states and 283 transitions. [2018-12-03 16:29:39,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:29:39,905 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 263 [2018-12-03 16:29:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:39,906 INFO L225 Difference]: With dead ends: 280 [2018-12-03 16:29:39,906 INFO L226 Difference]: Without dead ends: 274 [2018-12-03 16:29:39,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 472 SyntacticMatches, 104 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2704 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 16:29:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-03 16:29:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 270. [2018-12-03 16:29:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-12-03 16:29:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 272 transitions. [2018-12-03 16:29:39,935 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 272 transitions. Word has length 263 [2018-12-03 16:29:39,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:39,935 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 272 transitions. [2018-12-03 16:29:39,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:29:39,935 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 272 transitions. [2018-12-03 16:29:39,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-12-03 16:29:39,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:39,936 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 52, 52, 52, 1, 1, 1, 1, 1] [2018-12-03 16:29:39,936 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:39,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:39,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1240278145, now seen corresponding path program 103 times [2018-12-03 16:29:39,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:39,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:39,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:39,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:39,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:43,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6890 backedges. 5512 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:43,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:43,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:43,186 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:43,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:43,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:43,186 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 16:29:43,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:43,194 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:29:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:43,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:43,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6890 backedges. 5512 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:43,385 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:46,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6890 backedges. 5512 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:46,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:46,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 107 [2018-12-03 16:29:46,785 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:46,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 16:29:46,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 16:29:46,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2969, Invalid=8587, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:29:46,786 INFO L87 Difference]: Start difference. First operand 270 states and 272 transitions. Second operand 108 states. [2018-12-03 16:29:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:49,797 INFO L93 Difference]: Finished difference Result 490 states and 494 transitions. [2018-12-03 16:29:49,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 16:29:49,797 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 267 [2018-12-03 16:29:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:49,797 INFO L225 Difference]: With dead ends: 490 [2018-12-03 16:29:49,797 INFO L226 Difference]: Without dead ends: 271 [2018-12-03 16:29:49,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 428 SyntacticMatches, 105 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9542 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=5937, Invalid=19823, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 16:29:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-12-03 16:29:49,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-12-03 16:29:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-03 16:29:49,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 273 transitions. [2018-12-03 16:29:49,828 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 273 transitions. Word has length 267 [2018-12-03 16:29:49,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:49,828 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 273 transitions. [2018-12-03 16:29:49,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 16:29:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 273 transitions. [2018-12-03 16:29:49,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-03 16:29:49,829 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:49,829 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1, 1, 1, 1] [2018-12-03 16:29:49,829 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:49,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:49,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1999690342, now seen corresponding path program 104 times [2018-12-03 16:29:49,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:49,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:29:49,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:49,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6943 backedges. 1535 proven. 5408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:51,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:51,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:51,408 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:51,408 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:51,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:51,408 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 16:29:51,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:29:51,417 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:29:51,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 16:29:51,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:51,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:51,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6943 backedges. 1535 proven. 5408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:51,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:29:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6943 backedges. 1535 proven. 5408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:53,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:29:53,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 55 [2018-12-03 16:29:53,875 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:29:53,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:29:53,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:29:53,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:29:53,876 INFO L87 Difference]: Start difference. First operand 271 states and 273 transitions. Second operand 56 states. [2018-12-03 16:29:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:29:54,247 INFO L93 Difference]: Finished difference Result 285 states and 288 transitions. [2018-12-03 16:29:54,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:29:54,247 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 268 [2018-12-03 16:29:54,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:29:54,248 INFO L225 Difference]: With dead ends: 285 [2018-12-03 16:29:54,248 INFO L226 Difference]: Without dead ends: 279 [2018-12-03 16:29:54,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 641 GetRequests, 481 SyntacticMatches, 106 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2809 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:29:54,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-12-03 16:29:54,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 275. [2018-12-03 16:29:54,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-03 16:29:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 277 transitions. [2018-12-03 16:29:54,278 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 277 transitions. Word has length 268 [2018-12-03 16:29:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:29:54,278 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 277 transitions. [2018-12-03 16:29:54,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:29:54,279 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 277 transitions. [2018-12-03 16:29:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-03 16:29:54,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:29:54,279 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 53, 1, 1, 1, 1, 1] [2018-12-03 16:29:54,280 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:29:54,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:29:54,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1751242020, now seen corresponding path program 105 times [2018-12-03 16:29:54,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:29:54,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:54,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:29:54,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:29:54,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:29:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:29:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7155 backedges. 5724 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:57,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:57,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:29:57,897 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:29:57,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:29:57,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:29:57,898 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 16:29:57,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:29:57,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:29:58,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:29:58,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:29:58,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:29:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7155 backedges. 5724 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:29:58,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 7155 backedges. 5724 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:01,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:01,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 109 [2018-12-03 16:30:01,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:01,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 16:30:01,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 16:30:01,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=8911, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:30:01,604 INFO L87 Difference]: Start difference. First operand 275 states and 277 transitions. Second operand 110 states. [2018-12-03 16:30:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:06,143 INFO L93 Difference]: Finished difference Result 499 states and 503 transitions. [2018-12-03 16:30:06,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 16:30:06,143 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 272 [2018-12-03 16:30:06,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:06,144 INFO L225 Difference]: With dead ends: 499 [2018-12-03 16:30:06,144 INFO L226 Difference]: Without dead ends: 276 [2018-12-03 16:30:06,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 436 SyntacticMatches, 107 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9911 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=6157, Invalid=20575, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:30:06,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-12-03 16:30:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-12-03 16:30:06,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-12-03 16:30:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2018-12-03 16:30:06,199 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2018-12-03 16:30:06,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:06,199 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2018-12-03 16:30:06,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 16:30:06,200 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2018-12-03 16:30:06,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-12-03 16:30:06,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:06,201 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1, 1, 1, 1] [2018-12-03 16:30:06,203 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:06,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:06,203 INFO L82 PathProgramCache]: Analyzing trace with hash -104962987, now seen corresponding path program 106 times [2018-12-03 16:30:06,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:06,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:06,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:06,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:06,205 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:07,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 1591 proven. 5618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:07,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:07,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:07,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:07,518 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:07,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:07,518 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 16:30:07,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:07,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:07,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 1591 proven. 5618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:07,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:09,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7209 backedges. 1591 proven. 5618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:09,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:09,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2018-12-03 16:30:09,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:09,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:30:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:30:09,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:30:09,965 INFO L87 Difference]: Start difference. First operand 276 states and 278 transitions. Second operand 57 states. [2018-12-03 16:30:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:10,334 INFO L93 Difference]: Finished difference Result 290 states and 293 transitions. [2018-12-03 16:30:10,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:30:10,334 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 273 [2018-12-03 16:30:10,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:10,335 INFO L225 Difference]: With dead ends: 290 [2018-12-03 16:30:10,335 INFO L226 Difference]: Without dead ends: 284 [2018-12-03 16:30:10,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 490 SyntacticMatches, 108 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2916 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 16:30:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-03 16:30:10,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 280. [2018-12-03 16:30:10,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-03 16:30:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 282 transitions. [2018-12-03 16:30:10,366 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 282 transitions. Word has length 273 [2018-12-03 16:30:10,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:10,366 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 282 transitions. [2018-12-03 16:30:10,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:30:10,366 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 282 transitions. [2018-12-03 16:30:10,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-12-03 16:30:10,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:10,367 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 54, 54, 54, 1, 1, 1, 1, 1] [2018-12-03 16:30:10,367 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:10,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:10,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1553521333, now seen corresponding path program 107 times [2018-12-03 16:30:10,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:10,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:10,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:10,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:10,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 7425 backedges. 5940 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:14,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:14,052 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:14,052 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:14,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:14,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:14,053 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 16:30:14,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:30:14,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:30:14,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 16:30:14,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:14,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:14,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7425 backedges. 5940 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:14,373 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7425 backedges. 5940 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:17,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:17,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 111 [2018-12-03 16:30:17,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:17,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 16:30:17,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 16:30:17,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3191, Invalid=9241, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:30:17,868 INFO L87 Difference]: Start difference. First operand 280 states and 282 transitions. Second operand 112 states. [2018-12-03 16:30:22,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:22,124 INFO L93 Difference]: Finished difference Result 508 states and 512 transitions. [2018-12-03 16:30:22,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 16:30:22,124 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 277 [2018-12-03 16:30:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:22,125 INFO L225 Difference]: With dead ends: 508 [2018-12-03 16:30:22,125 INFO L226 Difference]: Without dead ends: 281 [2018-12-03 16:30:22,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 718 GetRequests, 444 SyntacticMatches, 109 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10287 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=6381, Invalid=21341, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 16:30:22,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-03 16:30:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-12-03 16:30:22,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-12-03 16:30:22,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 283 transitions. [2018-12-03 16:30:22,156 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 283 transitions. Word has length 277 [2018-12-03 16:30:22,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:22,156 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 283 transitions. [2018-12-03 16:30:22,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 16:30:22,157 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 283 transitions. [2018-12-03 16:30:22,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-12-03 16:30:22,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:22,157 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1, 1, 1, 1] [2018-12-03 16:30:22,158 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:22,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:22,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1476595854, now seen corresponding path program 108 times [2018-12-03 16:30:22,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:22,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:22,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:22,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:22,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7480 backedges. 1648 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:23,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:23,555 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:23,555 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:23,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:23,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:23,556 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 16:30:23,564 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:30:23,564 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:30:23,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:30:23,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:23,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 7480 backedges. 1648 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:23,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:26,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7480 backedges. 1648 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:26,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:26,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 57 [2018-12-03 16:30:26,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:26,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:30:26,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:30:26,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:30:26,185 INFO L87 Difference]: Start difference. First operand 281 states and 283 transitions. Second operand 58 states. [2018-12-03 16:30:26,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:26,586 INFO L93 Difference]: Finished difference Result 295 states and 298 transitions. [2018-12-03 16:30:26,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:30:26,586 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 278 [2018-12-03 16:30:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:26,587 INFO L225 Difference]: With dead ends: 295 [2018-12-03 16:30:26,587 INFO L226 Difference]: Without dead ends: 289 [2018-12-03 16:30:26,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 665 GetRequests, 499 SyntacticMatches, 110 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3025 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:30:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-03 16:30:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2018-12-03 16:30:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-12-03 16:30:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 287 transitions. [2018-12-03 16:30:26,619 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 287 transitions. Word has length 278 [2018-12-03 16:30:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:26,619 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 287 transitions. [2018-12-03 16:30:26,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:30:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 287 transitions. [2018-12-03 16:30:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-03 16:30:26,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:26,620 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 55, 1, 1, 1, 1, 1] [2018-12-03 16:30:26,620 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:26,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:26,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1426007576, now seen corresponding path program 109 times [2018-12-03 16:30:26,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:26,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:26,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:26,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:26,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:30,242 INFO L134 CoverageAnalysis]: Checked inductivity of 7700 backedges. 6160 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:30,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:30,242 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:30,242 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:30,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:30,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:30,242 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 16:30:30,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:30,251 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:30,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:30,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7700 backedges. 6160 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:30,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:34,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7700 backedges. 6160 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:34,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:34,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 113 [2018-12-03 16:30:34,247 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:34,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 16:30:34,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 16:30:34,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3305, Invalid=9577, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:30:34,248 INFO L87 Difference]: Start difference. First operand 285 states and 287 transitions. Second operand 114 states. [2018-12-03 16:30:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:39,024 INFO L93 Difference]: Finished difference Result 517 states and 521 transitions. [2018-12-03 16:30:39,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 16:30:39,024 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 282 [2018-12-03 16:30:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:39,025 INFO L225 Difference]: With dead ends: 517 [2018-12-03 16:30:39,025 INFO L226 Difference]: Without dead ends: 286 [2018-12-03 16:30:39,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 452 SyntacticMatches, 111 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10670 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=6609, Invalid=22121, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:30:39,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-12-03 16:30:39,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-12-03 16:30:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-03 16:30:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 288 transitions. [2018-12-03 16:30:39,059 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 288 transitions. Word has length 282 [2018-12-03 16:30:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:39,059 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 288 transitions. [2018-12-03 16:30:39,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 16:30:39,059 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 288 transitions. [2018-12-03 16:30:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-12-03 16:30:39,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:39,060 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1, 1, 1, 1] [2018-12-03 16:30:39,060 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:39,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:39,060 INFO L82 PathProgramCache]: Analyzing trace with hash 822497313, now seen corresponding path program 110 times [2018-12-03 16:30:39,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:39,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:39,061 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:39,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:39,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:40,462 INFO L134 CoverageAnalysis]: Checked inductivity of 7756 backedges. 1706 proven. 6050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:40,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:40,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:40,462 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:40,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:40,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:40,463 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 16:30:40,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:30:40,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:30:40,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 16:30:40,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:40,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7756 backedges. 1706 proven. 6050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:40,786 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:43,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7756 backedges. 1706 proven. 6050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:43,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:43,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 58 [2018-12-03 16:30:43,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:43,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:30:43,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:30:43,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:30:43,419 INFO L87 Difference]: Start difference. First operand 286 states and 288 transitions. Second operand 59 states. [2018-12-03 16:30:43,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:43,807 INFO L93 Difference]: Finished difference Result 300 states and 303 transitions. [2018-12-03 16:30:43,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:30:43,807 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 283 [2018-12-03 16:30:43,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:43,808 INFO L225 Difference]: With dead ends: 300 [2018-12-03 16:30:43,808 INFO L226 Difference]: Without dead ends: 294 [2018-12-03 16:30:43,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 508 SyntacticMatches, 112 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3136 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:30:43,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-12-03 16:30:43,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 290. [2018-12-03 16:30:43,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-12-03 16:30:43,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 292 transitions. [2018-12-03 16:30:43,842 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 292 transitions. Word has length 283 [2018-12-03 16:30:43,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:43,843 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 292 transitions. [2018-12-03 16:30:43,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:30:43,843 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 292 transitions. [2018-12-03 16:30:43,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-12-03 16:30:43,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:43,844 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 56, 56, 56, 1, 1, 1, 1, 1] [2018-12-03 16:30:43,844 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:43,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:43,844 INFO L82 PathProgramCache]: Analyzing trace with hash -637777129, now seen corresponding path program 111 times [2018-12-03 16:30:43,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:43,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:43,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:43,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:43,845 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:47,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7980 backedges. 6384 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:47,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:47,917 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:47,917 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:47,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:47,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:47,917 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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:47,925 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:30:47,925 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:30:48,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:30:48,062 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:30:48,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:48,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7980 backedges. 6384 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:48,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:51,799 INFO L134 CoverageAnalysis]: Checked inductivity of 7980 backedges. 6384 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:51,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:51,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 115 [2018-12-03 16:30:51,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:51,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-03 16:30:51,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-03 16:30:51,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=9919, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:30:51,819 INFO L87 Difference]: Start difference. First operand 290 states and 292 transitions. Second operand 116 states. [2018-12-03 16:30:54,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:54,958 INFO L93 Difference]: Finished difference Result 526 states and 530 transitions. [2018-12-03 16:30:54,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-12-03 16:30:54,959 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 287 [2018-12-03 16:30:54,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:54,959 INFO L225 Difference]: With dead ends: 526 [2018-12-03 16:30:54,959 INFO L226 Difference]: Without dead ends: 291 [2018-12-03 16:30:54,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 460 SyntacticMatches, 113 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11060 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=6841, Invalid=22915, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 16:30:54,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-12-03 16:30:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-12-03 16:30:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-12-03 16:30:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 293 transitions. [2018-12-03 16:30:55,019 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 293 transitions. Word has length 287 [2018-12-03 16:30:55,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:55,019 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 293 transitions. [2018-12-03 16:30:55,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-03 16:30:55,019 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 293 transitions. [2018-12-03 16:30:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-12-03 16:30:55,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:55,020 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1, 1, 1, 1] [2018-12-03 16:30:55,020 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:55,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:55,021 INFO L82 PathProgramCache]: Analyzing trace with hash 204787838, now seen corresponding path program 112 times [2018-12-03 16:30:55,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:55,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:55,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:30:55,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:55,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:56,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8037 backedges. 1765 proven. 6272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:56,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:56,441 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:30:56,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:30:56,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:30:56,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:30:56,442 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 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:30:56,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:56,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:30:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:30:56,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:30:56,650 INFO L134 CoverageAnalysis]: Checked inductivity of 8037 backedges. 1765 proven. 6272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:56,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:30:59,316 INFO L134 CoverageAnalysis]: Checked inductivity of 8037 backedges. 1765 proven. 6272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:30:59,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:30:59,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 59 [2018-12-03 16:30:59,336 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:30:59,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:30:59,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:30:59,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:30:59,336 INFO L87 Difference]: Start difference. First operand 291 states and 293 transitions. Second operand 60 states. [2018-12-03 16:30:59,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:30:59,759 INFO L93 Difference]: Finished difference Result 305 states and 308 transitions. [2018-12-03 16:30:59,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:30:59,759 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 288 [2018-12-03 16:30:59,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:30:59,760 INFO L225 Difference]: With dead ends: 305 [2018-12-03 16:30:59,760 INFO L226 Difference]: Without dead ends: 299 [2018-12-03 16:30:59,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 517 SyntacticMatches, 114 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3249 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:30:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-03 16:30:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 295. [2018-12-03 16:30:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-12-03 16:30:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 297 transitions. [2018-12-03 16:30:59,793 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 297 transitions. Word has length 288 [2018-12-03 16:30:59,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:30:59,793 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 297 transitions. [2018-12-03 16:30:59,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:30:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 297 transitions. [2018-12-03 16:30:59,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-12-03 16:30:59,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:30:59,794 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 57, 1, 1, 1, 1, 1] [2018-12-03 16:30:59,795 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:30:59,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:30:59,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2131318004, now seen corresponding path program 113 times [2018-12-03 16:30:59,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:30:59,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:59,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:30:59,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:30:59,796 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:30:59,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:04,096 INFO L134 CoverageAnalysis]: Checked inductivity of 8265 backedges. 6612 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:04,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:04,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:04,096 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:04,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:04,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:04,097 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 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:04,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:31:04,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:31:04,483 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 16:31:04,483 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:04,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8265 backedges. 6612 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:04,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8265 backedges. 6612 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:08,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:08,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117, 117, 117] total 117 [2018-12-03 16:31:08,435 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:08,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-03 16:31:08,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-03 16:31:08,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3539, Invalid=10267, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:31:08,436 INFO L87 Difference]: Start difference. First operand 295 states and 297 transitions. Second operand 118 states. [2018-12-03 16:31:13,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:13,679 INFO L93 Difference]: Finished difference Result 535 states and 539 transitions. [2018-12-03 16:31:13,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-12-03 16:31:13,679 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 292 [2018-12-03 16:31:13,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:13,680 INFO L225 Difference]: With dead ends: 535 [2018-12-03 16:31:13,680 INFO L226 Difference]: Without dead ends: 296 [2018-12-03 16:31:13,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 468 SyntacticMatches, 115 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11457 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=7077, Invalid=23723, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:31:13,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-03 16:31:13,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-12-03 16:31:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-12-03 16:31:13,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 298 transitions. [2018-12-03 16:31:13,714 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 298 transitions. Word has length 292 [2018-12-03 16:31:13,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:13,714 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 298 transitions. [2018-12-03 16:31:13,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-03 16:31:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 298 transitions. [2018-12-03 16:31:13,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-12-03 16:31:13,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:13,715 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1, 1, 1, 1] [2018-12-03 16:31:13,715 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:13,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:13,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1809901587, now seen corresponding path program 114 times [2018-12-03 16:31:13,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:13,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:13,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:13,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:13,717 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 8323 backedges. 1825 proven. 6498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:15,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:15,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:15,160 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:15,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:15,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:15,161 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 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:15,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:31:15,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:31:15,310 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:31:15,310 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:15,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:15,416 INFO L134 CoverageAnalysis]: Checked inductivity of 8323 backedges. 1825 proven. 6498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:15,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8323 backedges. 1825 proven. 6498 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:18,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:18,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 60 [2018-12-03 16:31:18,254 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:18,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:31:18,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:31:18,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:31:18,255 INFO L87 Difference]: Start difference. First operand 296 states and 298 transitions. Second operand 61 states. [2018-12-03 16:31:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:18,659 INFO L93 Difference]: Finished difference Result 310 states and 313 transitions. [2018-12-03 16:31:18,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:31:18,659 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 293 [2018-12-03 16:31:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:18,660 INFO L225 Difference]: With dead ends: 310 [2018-12-03 16:31:18,660 INFO L226 Difference]: Without dead ends: 304 [2018-12-03 16:31:18,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 526 SyntacticMatches, 116 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3364 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:31:18,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-12-03 16:31:18,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2018-12-03 16:31:18,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-12-03 16:31:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 302 transitions. [2018-12-03 16:31:18,720 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 302 transitions. Word has length 293 [2018-12-03 16:31:18,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:18,720 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 302 transitions. [2018-12-03 16:31:18,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:31:18,720 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 302 transitions. [2018-12-03 16:31:18,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-12-03 16:31:18,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:18,721 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 58, 58, 58, 1, 1, 1, 1, 1] [2018-12-03 16:31:18,721 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:18,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:18,721 INFO L82 PathProgramCache]: Analyzing trace with hash -258716445, now seen corresponding path program 115 times [2018-12-03 16:31:18,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:18,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:18,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:18,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:18,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:22,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8555 backedges. 6844 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:22,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:22,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:22,876 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:22,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:22,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:22,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 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:22,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:22,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:31:23,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:23,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 8555 backedges. 6844 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:23,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:27,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8555 backedges. 6844 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:27,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:27,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 119 [2018-12-03 16:31:27,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:27,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-03 16:31:27,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-03 16:31:27,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3659, Invalid=10621, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:31:27,342 INFO L87 Difference]: Start difference. First operand 300 states and 302 transitions. Second operand 120 states. [2018-12-03 16:31:31,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:31,633 INFO L93 Difference]: Finished difference Result 544 states and 548 transitions. [2018-12-03 16:31:31,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-12-03 16:31:31,633 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 297 [2018-12-03 16:31:31,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:31,634 INFO L225 Difference]: With dead ends: 544 [2018-12-03 16:31:31,634 INFO L226 Difference]: Without dead ends: 301 [2018-12-03 16:31:31,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 770 GetRequests, 476 SyntacticMatches, 117 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11861 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=7317, Invalid=24545, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 16:31:31,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-12-03 16:31:31,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-12-03 16:31:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-12-03 16:31:31,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 303 transitions. [2018-12-03 16:31:31,682 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 303 transitions. Word has length 297 [2018-12-03 16:31:31,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:31,683 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 303 transitions. [2018-12-03 16:31:31,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-03 16:31:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 303 transitions. [2018-12-03 16:31:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-12-03 16:31:31,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:31,684 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1, 1, 1, 1] [2018-12-03 16:31:31,684 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:31,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:31,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1974369674, now seen corresponding path program 116 times [2018-12-03 16:31:31,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:31,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:31,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:31,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:31,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:31,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 8614 backedges. 1886 proven. 6728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:33,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:33,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:33,394 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:33,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:33,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:33,394 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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:33,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:31:33,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:31:33,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 59 check-sat command(s) [2018-12-03 16:31:33,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:33,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 8614 backedges. 1886 proven. 6728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:33,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8614 backedges. 1886 proven. 6728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:36,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:36,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 61 [2018-12-03 16:31:36,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:36,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:31:36,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:31:36,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:31:36,329 INFO L87 Difference]: Start difference. First operand 301 states and 303 transitions. Second operand 62 states. [2018-12-03 16:31:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:36,821 INFO L93 Difference]: Finished difference Result 315 states and 318 transitions. [2018-12-03 16:31:36,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:31:36,830 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 298 [2018-12-03 16:31:36,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:36,831 INFO L225 Difference]: With dead ends: 315 [2018-12-03 16:31:36,831 INFO L226 Difference]: Without dead ends: 309 [2018-12-03 16:31:36,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 535 SyntacticMatches, 118 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3481 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:31:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-12-03 16:31:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 305. [2018-12-03 16:31:36,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-03 16:31:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 307 transitions. [2018-12-03 16:31:36,878 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 307 transitions. Word has length 298 [2018-12-03 16:31:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:36,878 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 307 transitions. [2018-12-03 16:31:36,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:31:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 307 transitions. [2018-12-03 16:31:36,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-12-03 16:31:36,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:36,879 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 59, 1, 1, 1, 1, 1] [2018-12-03 16:31:36,879 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:36,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:36,879 INFO L82 PathProgramCache]: Analyzing trace with hash 177052672, now seen corresponding path program 117 times [2018-12-03 16:31:36,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:36,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:36,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:41,450 INFO L134 CoverageAnalysis]: Checked inductivity of 8850 backedges. 7080 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:41,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:41,451 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:41,451 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:41,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:41,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:41,451 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 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:41,460 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:31:41,460 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:31:41,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:31:41,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:31:41,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8850 backedges. 7080 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:41,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 8850 backedges. 7080 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:46,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:46,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121, 121, 121] total 121 [2018-12-03 16:31:46,062 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:46,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-03 16:31:46,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-03 16:31:46,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=10981, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:31:46,063 INFO L87 Difference]: Start difference. First operand 305 states and 307 transitions. Second operand 122 states. [2018-12-03 16:31:50,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:50,049 INFO L93 Difference]: Finished difference Result 553 states and 557 transitions. [2018-12-03 16:31:50,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-12-03 16:31:50,050 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 302 [2018-12-03 16:31:50,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:50,050 INFO L225 Difference]: With dead ends: 553 [2018-12-03 16:31:50,050 INFO L226 Difference]: Without dead ends: 306 [2018-12-03 16:31:50,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 783 GetRequests, 484 SyntacticMatches, 119 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12272 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=7561, Invalid=25381, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:31:50,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-03 16:31:50,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-12-03 16:31:50,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-12-03 16:31:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 308 transitions. [2018-12-03 16:31:50,087 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 308 transitions. Word has length 302 [2018-12-03 16:31:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:50,087 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 308 transitions. [2018-12-03 16:31:50,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-03 16:31:50,087 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 308 transitions. [2018-12-03 16:31:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-03 16:31:50,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:50,088 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1, 1, 1, 1] [2018-12-03 16:31:50,089 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:50,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:50,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1421165639, now seen corresponding path program 118 times [2018-12-03 16:31:50,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:50,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:31:50,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:50,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:50,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:51,698 INFO L134 CoverageAnalysis]: Checked inductivity of 8910 backedges. 1948 proven. 6962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:51,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:51,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:31:51,699 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:31:51,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:31:51,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:31:51,699 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 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:31:51,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:51,707 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:31:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:31:51,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:31:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 8910 backedges. 1948 proven. 6962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:51,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:31:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 8910 backedges. 1948 proven. 6962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:31:54,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:31:54,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 62 [2018-12-03 16:31:54,998 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:31:54,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:31:54,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:31:54,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 16:31:54,999 INFO L87 Difference]: Start difference. First operand 306 states and 308 transitions. Second operand 63 states. [2018-12-03 16:31:55,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:31:55,428 INFO L93 Difference]: Finished difference Result 320 states and 323 transitions. [2018-12-03 16:31:55,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:31:55,428 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 303 [2018-12-03 16:31:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:31:55,429 INFO L225 Difference]: With dead ends: 320 [2018-12-03 16:31:55,429 INFO L226 Difference]: Without dead ends: 314 [2018-12-03 16:31:55,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 544 SyntacticMatches, 120 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3600 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 16:31:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-03 16:31:55,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2018-12-03 16:31:55,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-12-03 16:31:55,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 312 transitions. [2018-12-03 16:31:55,465 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 312 transitions. Word has length 303 [2018-12-03 16:31:55,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:31:55,465 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 312 transitions. [2018-12-03 16:31:55,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:31:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 312 transitions. [2018-12-03 16:31:55,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-12-03 16:31:55,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:31:55,467 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 60, 60, 60, 1, 1, 1, 1, 1] [2018-12-03 16:31:55,467 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:31:55,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:31:55,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2121345711, now seen corresponding path program 119 times [2018-12-03 16:31:55,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:31:55,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:55,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:31:55,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:31:55,468 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:31:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:00,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9150 backedges. 7320 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:00,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:00,050 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:00,050 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:00,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:00,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:00,050 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 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:00,061 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:32:00,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:32:00,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-12-03 16:32:00,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:00,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9150 backedges. 7320 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:00,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9150 backedges. 7320 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:04,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:04,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123, 123] total 123 [2018-12-03 16:32:04,728 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:04,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-03 16:32:04,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-03 16:32:04,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3905, Invalid=11347, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:32:04,729 INFO L87 Difference]: Start difference. First operand 310 states and 312 transitions. Second operand 124 states. [2018-12-03 16:32:08,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:08,117 INFO L93 Difference]: Finished difference Result 562 states and 566 transitions. [2018-12-03 16:32:08,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-12-03 16:32:08,117 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 307 [2018-12-03 16:32:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:08,118 INFO L225 Difference]: With dead ends: 562 [2018-12-03 16:32:08,118 INFO L226 Difference]: Without dead ends: 311 [2018-12-03 16:32:08,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 796 GetRequests, 492 SyntacticMatches, 121 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12690 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=7809, Invalid=26231, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 16:32:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-12-03 16:32:08,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-12-03 16:32:08,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-12-03 16:32:08,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 313 transitions. [2018-12-03 16:32:08,156 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 313 transitions. Word has length 307 [2018-12-03 16:32:08,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:08,156 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 313 transitions. [2018-12-03 16:32:08,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-03 16:32:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 313 transitions. [2018-12-03 16:32:08,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-12-03 16:32:08,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:08,157 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1, 1, 1, 1] [2018-12-03 16:32:08,157 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:08,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:08,157 INFO L82 PathProgramCache]: Analyzing trace with hash -306186602, now seen corresponding path program 120 times [2018-12-03 16:32:08,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:08,158 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:08,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:08,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:10,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9211 backedges. 2011 proven. 7200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:10,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:10,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:10,021 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:10,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 16:32:10,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:10,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 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:10,029 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:32:10,029 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:32:10,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:32:10,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:10,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 9211 backedges. 2011 proven. 7200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:10,261 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:13,049 INFO L134 CoverageAnalysis]: Checked inductivity of 9211 backedges. 2011 proven. 7200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:13,068 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:13,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 63 [2018-12-03 16:32:13,068 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:13,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:32:13,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:32:13,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:32:13,069 INFO L87 Difference]: Start difference. First operand 311 states and 313 transitions. Second operand 64 states. [2018-12-03 16:32:13,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:13,610 INFO L93 Difference]: Finished difference Result 325 states and 328 transitions. [2018-12-03 16:32:13,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:32:13,611 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 308 [2018-12-03 16:32:13,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:13,611 INFO L225 Difference]: With dead ends: 325 [2018-12-03 16:32:13,612 INFO L226 Difference]: Without dead ends: 319 [2018-12-03 16:32:13,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 737 GetRequests, 553 SyntacticMatches, 122 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3721 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:32:13,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-12-03 16:32:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2018-12-03 16:32:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-12-03 16:32:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 317 transitions. [2018-12-03 16:32:13,652 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 317 transitions. Word has length 308 [2018-12-03 16:32:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:13,652 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 317 transitions. [2018-12-03 16:32:13,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:32:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 317 transitions. [2018-12-03 16:32:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-12-03 16:32:13,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:13,653 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 61, 1, 1, 1, 1, 1] [2018-12-03 16:32:13,653 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:13,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1142706420, now seen corresponding path program 121 times [2018-12-03 16:32:13,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:13,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:13,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:13,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:13,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:18,122 INFO L134 CoverageAnalysis]: Checked inductivity of 9455 backedges. 7564 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:18,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:18,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:18,123 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:18,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:18,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:18,123 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 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:18,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:18,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:32:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:18,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:18,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9455 backedges. 7564 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:18,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 9455 backedges. 7564 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:22,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:22,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125, 125, 125] total 125 [2018-12-03 16:32:22,832 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:22,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-03 16:32:22,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-03 16:32:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4031, Invalid=11719, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:32:22,834 INFO L87 Difference]: Start difference. First operand 315 states and 317 transitions. Second operand 126 states. [2018-12-03 16:32:27,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:27,464 INFO L93 Difference]: Finished difference Result 571 states and 575 transitions. [2018-12-03 16:32:27,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-12-03 16:32:27,464 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 312 [2018-12-03 16:32:27,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:27,465 INFO L225 Difference]: With dead ends: 571 [2018-12-03 16:32:27,465 INFO L226 Difference]: Without dead ends: 316 [2018-12-03 16:32:27,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 500 SyntacticMatches, 123 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13115 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=8061, Invalid=27095, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:32:27,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-12-03 16:32:27,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2018-12-03 16:32:27,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-12-03 16:32:27,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 318 transitions. [2018-12-03 16:32:27,504 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 318 transitions. Word has length 312 [2018-12-03 16:32:27,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:27,504 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 318 transitions. [2018-12-03 16:32:27,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-03 16:32:27,504 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 318 transitions. [2018-12-03 16:32:27,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-12-03 16:32:27,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:27,506 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1, 1, 1, 1] [2018-12-03 16:32:27,506 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:27,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:27,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1622459515, now seen corresponding path program 122 times [2018-12-03 16:32:27,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:27,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:27,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:27,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:27,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 9517 backedges. 2075 proven. 7442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:29,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:29,481 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:29,481 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:29,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:29,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:29,481 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 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:29,489 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:32:29,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:32:29,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2018-12-03 16:32:29,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:29,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:29,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9517 backedges. 2075 proven. 7442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:29,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:32,745 INFO L134 CoverageAnalysis]: Checked inductivity of 9517 backedges. 2075 proven. 7442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:32,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:32,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 64 [2018-12-03 16:32:32,764 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:32,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:32:32,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:32:32,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:32:32,766 INFO L87 Difference]: Start difference. First operand 316 states and 318 transitions. Second operand 65 states. [2018-12-03 16:32:33,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:33,304 INFO L93 Difference]: Finished difference Result 330 states and 333 transitions. [2018-12-03 16:32:33,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:32:33,305 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 313 [2018-12-03 16:32:33,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:33,305 INFO L225 Difference]: With dead ends: 330 [2018-12-03 16:32:33,306 INFO L226 Difference]: Without dead ends: 324 [2018-12-03 16:32:33,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 562 SyntacticMatches, 124 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3844 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:32:33,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-12-03 16:32:33,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 320. [2018-12-03 16:32:33,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-12-03 16:32:33,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 322 transitions. [2018-12-03 16:32:33,344 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 322 transitions. Word has length 313 [2018-12-03 16:32:33,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:33,345 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 322 transitions. [2018-12-03 16:32:33,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:32:33,345 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 322 transitions. [2018-12-03 16:32:33,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-12-03 16:32:33,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:33,346 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 62, 62, 62, 1, 1, 1, 1, 1] [2018-12-03 16:32:33,346 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:33,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:33,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2069161083, now seen corresponding path program 123 times [2018-12-03 16:32:33,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:33,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:33,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:33,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:33,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:33,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:38,137 INFO L134 CoverageAnalysis]: Checked inductivity of 9765 backedges. 7812 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:38,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:38,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:38,137 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:38,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:38,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:38,137 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 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:38,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:32:38,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:32:38,303 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:32:38,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:38,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9765 backedges. 7812 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:38,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:42,996 INFO L134 CoverageAnalysis]: Checked inductivity of 9765 backedges. 7812 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:43,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:43,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 127 [2018-12-03 16:32:43,017 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:43,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-03 16:32:43,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-03 16:32:43,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:32:43,018 INFO L87 Difference]: Start difference. First operand 320 states and 322 transitions. Second operand 128 states. [2018-12-03 16:32:47,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:47,752 INFO L93 Difference]: Finished difference Result 580 states and 584 transitions. [2018-12-03 16:32:47,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-12-03 16:32:47,753 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 317 [2018-12-03 16:32:47,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:47,753 INFO L225 Difference]: With dead ends: 580 [2018-12-03 16:32:47,753 INFO L226 Difference]: Without dead ends: 321 [2018-12-03 16:32:47,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 822 GetRequests, 508 SyntacticMatches, 125 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13547 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=8317, Invalid=27973, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 16:32:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-12-03 16:32:47,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-12-03 16:32:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-12-03 16:32:47,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 323 transitions. [2018-12-03 16:32:47,794 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 323 transitions. Word has length 317 [2018-12-03 16:32:47,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:47,794 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 323 transitions. [2018-12-03 16:32:47,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-03 16:32:47,794 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 323 transitions. [2018-12-03 16:32:47,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-12-03 16:32:47,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:47,795 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1, 1, 1, 1] [2018-12-03 16:32:47,795 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:47,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:47,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1430207394, now seen corresponding path program 124 times [2018-12-03 16:32:47,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:47,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:47,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:32:47,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:47,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:47,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:49,810 INFO L134 CoverageAnalysis]: Checked inductivity of 9828 backedges. 2140 proven. 7688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:49,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:49,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:49,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:49,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:49,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:49,811 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 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:49,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:49,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:32:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:49,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:50,041 INFO L134 CoverageAnalysis]: Checked inductivity of 9828 backedges. 2140 proven. 7688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:50,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:32:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 9828 backedges. 2140 proven. 7688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:53,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:32:53,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 65 [2018-12-03 16:32:53,098 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:32:53,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:32:53,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:32:53,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:32:53,100 INFO L87 Difference]: Start difference. First operand 321 states and 323 transitions. Second operand 66 states. [2018-12-03 16:32:53,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:32:53,607 INFO L93 Difference]: Finished difference Result 335 states and 338 transitions. [2018-12-03 16:32:53,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:32:53,608 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 318 [2018-12-03 16:32:53,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:32:53,609 INFO L225 Difference]: With dead ends: 335 [2018-12-03 16:32:53,609 INFO L226 Difference]: Without dead ends: 329 [2018-12-03 16:32:53,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 761 GetRequests, 571 SyntacticMatches, 126 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3969 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:32:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-12-03 16:32:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 325. [2018-12-03 16:32:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-12-03 16:32:53,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 327 transitions. [2018-12-03 16:32:53,644 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 327 transitions. Word has length 318 [2018-12-03 16:32:53,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:32:53,645 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 327 transitions. [2018-12-03 16:32:53,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:32:53,645 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 327 transitions. [2018-12-03 16:32:53,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-12-03 16:32:53,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:32:53,646 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 63, 1, 1, 1, 1, 1] [2018-12-03 16:32:53,646 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:32:53,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:32:53,646 INFO L82 PathProgramCache]: Analyzing trace with hash 417435160, now seen corresponding path program 125 times [2018-12-03 16:32:53,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:32:53,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:53,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:32:53,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:32:53,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:32:53,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:32:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10080 backedges. 8064 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:58,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:58,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:32:58,524 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:32:58,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:32:58,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:32:58,524 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 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:32:58,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:32:58,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:32:58,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-12-03 16:32:58,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:32:58,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:32:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 10080 backedges. 8064 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:32:58,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:03,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10080 backedges. 8064 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:03,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:03,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129, 129, 129] total 129 [2018-12-03 16:33:03,682 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:03,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-03 16:33:03,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-03 16:33:03,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4289, Invalid=12481, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:33:03,684 INFO L87 Difference]: Start difference. First operand 325 states and 327 transitions. Second operand 130 states. [2018-12-03 16:33:08,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:08,638 INFO L93 Difference]: Finished difference Result 589 states and 593 transitions. [2018-12-03 16:33:08,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-12-03 16:33:08,638 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 322 [2018-12-03 16:33:08,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:08,639 INFO L225 Difference]: With dead ends: 589 [2018-12-03 16:33:08,639 INFO L226 Difference]: Without dead ends: 326 [2018-12-03 16:33:08,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 835 GetRequests, 516 SyntacticMatches, 127 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13986 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=8577, Invalid=28865, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:33:08,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-12-03 16:33:08,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2018-12-03 16:33:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-12-03 16:33:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 328 transitions. [2018-12-03 16:33:08,680 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 328 transitions. Word has length 322 [2018-12-03 16:33:08,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:08,681 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 328 transitions. [2018-12-03 16:33:08,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-03 16:33:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 328 transitions. [2018-12-03 16:33:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-12-03 16:33:08,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:08,682 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1, 1, 1, 1] [2018-12-03 16:33:08,682 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:08,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:08,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1721591983, now seen corresponding path program 126 times [2018-12-03 16:33:08,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:08,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:08,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:08,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:08,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10144 backedges. 2206 proven. 7938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:10,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:10,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:10,790 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:10,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:10,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:10,790 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 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:10,802 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:33:10,802 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:33:10,958 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:33:10,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:10,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10144 backedges. 2206 proven. 7938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:11,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 10144 backedges. 2206 proven. 7938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:14,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:14,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 66 [2018-12-03 16:33:14,111 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:14,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:33:14,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:33:14,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:33:14,112 INFO L87 Difference]: Start difference. First operand 326 states and 328 transitions. Second operand 67 states. [2018-12-03 16:33:14,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:14,671 INFO L93 Difference]: Finished difference Result 340 states and 343 transitions. [2018-12-03 16:33:14,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:33:14,677 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 323 [2018-12-03 16:33:14,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:14,678 INFO L225 Difference]: With dead ends: 340 [2018-12-03 16:33:14,678 INFO L226 Difference]: Without dead ends: 334 [2018-12-03 16:33:14,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 773 GetRequests, 580 SyntacticMatches, 128 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4096 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:33:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-12-03 16:33:14,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 330. [2018-12-03 16:33:14,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-12-03 16:33:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 332 transitions. [2018-12-03 16:33:14,735 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 332 transitions. Word has length 323 [2018-12-03 16:33:14,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:14,735 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 332 transitions. [2018-12-03 16:33:14,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:33:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 332 transitions. [2018-12-03 16:33:14,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-12-03 16:33:14,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:14,736 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 64, 64, 64, 1, 1, 1, 1, 1] [2018-12-03 16:33:14,737 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:14,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:14,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1618904505, now seen corresponding path program 127 times [2018-12-03 16:33:14,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:14,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:14,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:14,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:14,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 10400 backedges. 8320 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:19,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:19,719 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:19,719 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:19,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:19,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:19,720 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 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:19,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:19,732 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:33:19,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:19,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 10400 backedges. 8320 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:20,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:24,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10400 backedges. 8320 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:24,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:24,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131, 131] total 131 [2018-12-03 16:33:24,916 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:24,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-03 16:33:24,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-03 16:33:24,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4421, Invalid=12871, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:33:24,918 INFO L87 Difference]: Start difference. First operand 330 states and 332 transitions. Second operand 132 states. [2018-12-03 16:33:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:29,494 INFO L93 Difference]: Finished difference Result 598 states and 602 transitions. [2018-12-03 16:33:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-12-03 16:33:29,494 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 327 [2018-12-03 16:33:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:29,495 INFO L225 Difference]: With dead ends: 598 [2018-12-03 16:33:29,496 INFO L226 Difference]: Without dead ends: 331 [2018-12-03 16:33:29,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 848 GetRequests, 524 SyntacticMatches, 129 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14432 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=8841, Invalid=29771, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 16:33:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-12-03 16:33:29,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-12-03 16:33:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-12-03 16:33:29,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 333 transitions. [2018-12-03 16:33:29,534 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 333 transitions. Word has length 327 [2018-12-03 16:33:29,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:29,534 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 333 transitions. [2018-12-03 16:33:29,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-03 16:33:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 333 transitions. [2018-12-03 16:33:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-12-03 16:33:29,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:29,535 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1, 1, 1, 1] [2018-12-03 16:33:29,536 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:29,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:29,536 INFO L82 PathProgramCache]: Analyzing trace with hash 75648174, now seen corresponding path program 128 times [2018-12-03 16:33:29,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:29,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:29,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:29,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:29,537 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10465 backedges. 2273 proven. 8192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:31,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:31,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:31,648 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:31,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:31,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:31,648 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 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:31,662 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:33:31,662 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:33:31,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 65 check-sat command(s) [2018-12-03 16:33:31,970 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:31,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:32,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10465 backedges. 2273 proven. 8192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:32,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10465 backedges. 2273 proven. 8192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:35,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:35,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 67 [2018-12-03 16:33:35,305 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:35,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:33:35,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:33:35,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:33:35,306 INFO L87 Difference]: Start difference. First operand 331 states and 333 transitions. Second operand 68 states. [2018-12-03 16:33:36,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:36,051 INFO L93 Difference]: Finished difference Result 345 states and 348 transitions. [2018-12-03 16:33:36,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:33:36,052 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 328 [2018-12-03 16:33:36,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:36,052 INFO L225 Difference]: With dead ends: 345 [2018-12-03 16:33:36,053 INFO L226 Difference]: Without dead ends: 339 [2018-12-03 16:33:36,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 785 GetRequests, 589 SyntacticMatches, 130 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4225 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:33:36,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-12-03 16:33:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2018-12-03 16:33:36,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-12-03 16:33:36,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 337 transitions. [2018-12-03 16:33:36,094 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 337 transitions. Word has length 328 [2018-12-03 16:33:36,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:36,094 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 337 transitions. [2018-12-03 16:33:36,094 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:33:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 337 transitions. [2018-12-03 16:33:36,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-12-03 16:33:36,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:36,096 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 65, 1, 1, 1, 1, 1] [2018-12-03 16:33:36,096 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:36,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:36,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1591556388, now seen corresponding path program 129 times [2018-12-03 16:33:36,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:36,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:36,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:36,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:41,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10725 backedges. 8580 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:41,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:41,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:41,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:41,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:41,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:41,336 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 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:41,344 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:33:41,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:33:41,506 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:33:41,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:33:41,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 10725 backedges. 8580 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:41,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:46,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10725 backedges. 8580 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:46,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:46,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133, 133, 133] total 133 [2018-12-03 16:33:46,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:46,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 16:33:46,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 16:33:46,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4555, Invalid=13267, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:33:46,680 INFO L87 Difference]: Start difference. First operand 335 states and 337 transitions. Second operand 134 states. [2018-12-03 16:33:51,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:51,969 INFO L93 Difference]: Finished difference Result 607 states and 611 transitions. [2018-12-03 16:33:51,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-12-03 16:33:51,969 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 332 [2018-12-03 16:33:51,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:51,970 INFO L225 Difference]: With dead ends: 607 [2018-12-03 16:33:51,970 INFO L226 Difference]: Without dead ends: 336 [2018-12-03 16:33:51,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 861 GetRequests, 532 SyntacticMatches, 131 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14885 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=9109, Invalid=30691, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:33:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-12-03 16:33:52,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2018-12-03 16:33:52,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-12-03 16:33:52,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 338 transitions. [2018-12-03 16:33:52,016 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 338 transitions. Word has length 332 [2018-12-03 16:33:52,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:52,016 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 338 transitions. [2018-12-03 16:33:52,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 16:33:52,016 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 338 transitions. [2018-12-03 16:33:52,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-12-03 16:33:52,017 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:52,018 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1, 1, 1, 1] [2018-12-03 16:33:52,018 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:52,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:52,018 INFO L82 PathProgramCache]: Analyzing trace with hash 592629533, now seen corresponding path program 130 times [2018-12-03 16:33:52,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:52,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:52,019 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:33:52,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:52,019 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:53,892 INFO L134 CoverageAnalysis]: Checked inductivity of 10791 backedges. 2341 proven. 8450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:53,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:53,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:33:53,893 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:33:53,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:33:53,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:33:53,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 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:33:53,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:53,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:33:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:33:54,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:33:54,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10791 backedges. 2341 proven. 8450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:54,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:33:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 10791 backedges. 2341 proven. 8450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:33:57,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:33:57,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 68 [2018-12-03 16:33:57,738 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:33:57,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:33:57,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:33:57,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 16:33:57,739 INFO L87 Difference]: Start difference. First operand 336 states and 338 transitions. Second operand 69 states. [2018-12-03 16:33:58,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:33:58,206 INFO L93 Difference]: Finished difference Result 350 states and 353 transitions. [2018-12-03 16:33:58,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:33:58,206 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 333 [2018-12-03 16:33:58,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:33:58,207 INFO L225 Difference]: With dead ends: 350 [2018-12-03 16:33:58,207 INFO L226 Difference]: Without dead ends: 344 [2018-12-03 16:33:58,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 598 SyntacticMatches, 132 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4356 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 16:33:58,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-12-03 16:33:58,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 340. [2018-12-03 16:33:58,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-12-03 16:33:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 342 transitions. [2018-12-03 16:33:58,250 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 342 transitions. Word has length 333 [2018-12-03 16:33:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:33:58,250 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 342 transitions. [2018-12-03 16:33:58,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:33:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 342 transitions. [2018-12-03 16:33:58,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-12-03 16:33:58,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:33:58,251 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 66, 66, 66, 1, 1, 1, 1, 1] [2018-12-03 16:33:58,251 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:33:58,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:33:58,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1011291117, now seen corresponding path program 131 times [2018-12-03 16:33:58,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:33:58,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:58,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:33:58,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:33:58,252 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:33:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:03,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11055 backedges. 8844 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:03,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:03,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:03,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:03,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:03,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:03,530 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 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:03,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:34:03,541 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:34:03,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 67 check-sat command(s) [2018-12-03 16:34:03,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:03,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:03,963 INFO L134 CoverageAnalysis]: Checked inductivity of 11055 backedges. 8844 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:03,964 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:09,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11055 backedges. 8844 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:09,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:09,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135, 135] total 135 [2018-12-03 16:34:09,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:09,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-03 16:34:09,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-03 16:34:09,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4691, Invalid=13669, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:34:09,188 INFO L87 Difference]: Start difference. First operand 340 states and 342 transitions. Second operand 136 states. [2018-12-03 16:34:14,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:14,816 INFO L93 Difference]: Finished difference Result 616 states and 620 transitions. [2018-12-03 16:34:14,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-12-03 16:34:14,816 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 337 [2018-12-03 16:34:14,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:14,817 INFO L225 Difference]: With dead ends: 616 [2018-12-03 16:34:14,817 INFO L226 Difference]: Without dead ends: 341 [2018-12-03 16:34:14,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 874 GetRequests, 540 SyntacticMatches, 133 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15345 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=9381, Invalid=31625, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 16:34:14,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-12-03 16:34:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-12-03 16:34:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-12-03 16:34:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 343 transitions. [2018-12-03 16:34:14,883 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 343 transitions. Word has length 337 [2018-12-03 16:34:14,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:14,883 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 343 transitions. [2018-12-03 16:34:14,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-03 16:34:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 343 transitions. [2018-12-03 16:34:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-12-03 16:34:14,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:14,884 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1, 1, 1, 1] [2018-12-03 16:34:14,885 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:14,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:14,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1801398714, now seen corresponding path program 132 times [2018-12-03 16:34:14,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:14,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:14,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:14,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:14,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 11122 backedges. 2410 proven. 8712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:17,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:17,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:17,168 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:17,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:17,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:17,168 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 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:17,177 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:34:17,177 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:34:17,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:34:17,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:17,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 11122 backedges. 2410 proven. 8712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:17,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:20,757 INFO L134 CoverageAnalysis]: Checked inductivity of 11122 backedges. 2410 proven. 8712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:20,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:20,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 69 [2018-12-03 16:34:20,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:20,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:34:20,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:34:20,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:34:20,778 INFO L87 Difference]: Start difference. First operand 341 states and 343 transitions. Second operand 70 states. [2018-12-03 16:34:21,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:21,283 INFO L93 Difference]: Finished difference Result 355 states and 358 transitions. [2018-12-03 16:34:21,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:34:21,283 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 338 [2018-12-03 16:34:21,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:21,284 INFO L225 Difference]: With dead ends: 355 [2018-12-03 16:34:21,284 INFO L226 Difference]: Without dead ends: 349 [2018-12-03 16:34:21,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 607 SyntacticMatches, 134 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4489 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:34:21,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-12-03 16:34:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 345. [2018-12-03 16:34:21,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-12-03 16:34:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 347 transitions. [2018-12-03 16:34:21,328 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 347 transitions. Word has length 338 [2018-12-03 16:34:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:21,328 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 347 transitions. [2018-12-03 16:34:21,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:34:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 347 transitions. [2018-12-03 16:34:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-12-03 16:34:21,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:21,330 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 67, 1, 1, 1, 1, 1] [2018-12-03 16:34:21,330 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:21,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:21,331 INFO L82 PathProgramCache]: Analyzing trace with hash 581742640, now seen corresponding path program 133 times [2018-12-03 16:34:21,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:21,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:21,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:21,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:21,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 11390 backedges. 9112 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:26,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:26,925 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:26,926 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:26,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:26,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:26,926 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 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:26,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:26,934 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:34:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:27,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:27,185 INFO L134 CoverageAnalysis]: Checked inductivity of 11390 backedges. 9112 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:27,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 11390 backedges. 9112 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:32,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:32,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137, 137, 137] total 137 [2018-12-03 16:34:32,514 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:32,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-03 16:34:32,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-03 16:34:32,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4829, Invalid=14077, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:34:32,516 INFO L87 Difference]: Start difference. First operand 345 states and 347 transitions. Second operand 138 states. [2018-12-03 16:34:39,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:39,793 INFO L93 Difference]: Finished difference Result 625 states and 629 transitions. [2018-12-03 16:34:39,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-12-03 16:34:39,793 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 342 [2018-12-03 16:34:39,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:39,794 INFO L225 Difference]: With dead ends: 625 [2018-12-03 16:34:39,794 INFO L226 Difference]: Without dead ends: 346 [2018-12-03 16:34:39,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 887 GetRequests, 548 SyntacticMatches, 135 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15812 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=9657, Invalid=32573, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:34:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-12-03 16:34:39,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-12-03 16:34:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-12-03 16:34:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 348 transitions. [2018-12-03 16:34:39,839 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 348 transitions. Word has length 342 [2018-12-03 16:34:39,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:39,839 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 348 transitions. [2018-12-03 16:34:39,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-03 16:34:39,839 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 348 transitions. [2018-12-03 16:34:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-12-03 16:34:39,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:39,840 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1, 1, 1, 1] [2018-12-03 16:34:39,841 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:39,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:39,841 INFO L82 PathProgramCache]: Analyzing trace with hash -2023890199, now seen corresponding path program 134 times [2018-12-03 16:34:39,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:39,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:39,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:34:39,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:39,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 11458 backedges. 2480 proven. 8978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:41,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:41,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:41,850 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:41,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:41,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:41,850 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 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:41,859 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:34:41,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:34:42,262 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2018-12-03 16:34:42,262 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:42,269 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:42,358 INFO L134 CoverageAnalysis]: Checked inductivity of 11458 backedges. 2480 proven. 8978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:42,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:45,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11458 backedges. 2480 proven. 8978 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:45,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:45,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 70 [2018-12-03 16:34:45,831 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:45,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:34:45,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:34:45,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:34:45,832 INFO L87 Difference]: Start difference. First operand 346 states and 348 transitions. Second operand 71 states. [2018-12-03 16:34:46,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:34:46,275 INFO L93 Difference]: Finished difference Result 360 states and 363 transitions. [2018-12-03 16:34:46,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:34:46,275 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 343 [2018-12-03 16:34:46,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:34:46,276 INFO L225 Difference]: With dead ends: 360 [2018-12-03 16:34:46,276 INFO L226 Difference]: Without dead ends: 354 [2018-12-03 16:34:46,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 616 SyntacticMatches, 136 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4624 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:34:46,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-03 16:34:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 350. [2018-12-03 16:34:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-12-03 16:34:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 352 transitions. [2018-12-03 16:34:46,321 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 352 transitions. Word has length 343 [2018-12-03 16:34:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:34:46,321 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 352 transitions. [2018-12-03 16:34:46,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:34:46,321 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 352 transitions. [2018-12-03 16:34:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-12-03 16:34:46,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:34:46,322 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 68, 68, 68, 1, 1, 1, 1, 1] [2018-12-03 16:34:46,322 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:34:46,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:34:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1094531551, now seen corresponding path program 135 times [2018-12-03 16:34:46,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:34:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:46,323 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:34:46,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:34:46,323 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:34:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:34:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 11730 backedges. 9384 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:52,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:52,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:34:52,016 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:34:52,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:34:52,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:34:52,016 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 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:34:52,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:34:52,048 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:34:52,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:34:52,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:34:52,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:34:52,323 INFO L134 CoverageAnalysis]: Checked inductivity of 11730 backedges. 9384 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:52,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:34:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 11730 backedges. 9384 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:34:57,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:34:57,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139, 139] total 139 [2018-12-03 16:34:57,932 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:34:57,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-03 16:34:57,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-03 16:34:57,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4969, Invalid=14491, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:34:57,933 INFO L87 Difference]: Start difference. First operand 350 states and 352 transitions. Second operand 140 states. [2018-12-03 16:35:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:05,549 INFO L93 Difference]: Finished difference Result 634 states and 638 transitions. [2018-12-03 16:35:05,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-12-03 16:35:05,549 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 347 [2018-12-03 16:35:05,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:05,550 INFO L225 Difference]: With dead ends: 634 [2018-12-03 16:35:05,550 INFO L226 Difference]: Without dead ends: 351 [2018-12-03 16:35:05,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 556 SyntacticMatches, 137 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16286 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=9937, Invalid=33535, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 16:35:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-03 16:35:05,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-12-03 16:35:05,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-12-03 16:35:05,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 353 transitions. [2018-12-03 16:35:05,617 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 353 transitions. Word has length 347 [2018-12-03 16:35:05,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:05,617 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 353 transitions. [2018-12-03 16:35:05,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-03 16:35:05,617 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 353 transitions. [2018-12-03 16:35:05,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-12-03 16:35:05,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:05,619 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1, 1, 1, 1] [2018-12-03 16:35:05,619 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:05,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:05,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1322528058, now seen corresponding path program 136 times [2018-12-03 16:35:05,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:05,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:05,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:05,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:05,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 11799 backedges. 2551 proven. 9248 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:07,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:07,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:07,931 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:07,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 16:35:07,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:07,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 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:07,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:07,940 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:35:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:08,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 11799 backedges. 2551 proven. 9248 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:08,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:11,718 INFO L134 CoverageAnalysis]: Checked inductivity of 11799 backedges. 2551 proven. 9248 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:11,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:11,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 71 [2018-12-03 16:35:11,738 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:11,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:35:11,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:35:11,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:35:11,739 INFO L87 Difference]: Start difference. First operand 351 states and 353 transitions. Second operand 72 states. [2018-12-03 16:35:12,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:12,239 INFO L93 Difference]: Finished difference Result 365 states and 368 transitions. [2018-12-03 16:35:12,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:35:12,240 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 348 [2018-12-03 16:35:12,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:12,241 INFO L225 Difference]: With dead ends: 365 [2018-12-03 16:35:12,241 INFO L226 Difference]: Without dead ends: 359 [2018-12-03 16:35:12,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 625 SyntacticMatches, 138 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4761 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:35:12,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-12-03 16:35:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 355. [2018-12-03 16:35:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-12-03 16:35:12,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 357 transitions. [2018-12-03 16:35:12,289 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 357 transitions. Word has length 348 [2018-12-03 16:35:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:12,289 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 357 transitions. [2018-12-03 16:35:12,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:35:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 357 transitions. [2018-12-03 16:35:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-12-03 16:35:12,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:12,290 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 69, 1, 1, 1, 1, 1] [2018-12-03 16:35:12,290 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:12,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash -257559748, now seen corresponding path program 137 times [2018-12-03 16:35:12,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:12,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:12,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:12,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:18,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12075 backedges. 9660 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:18,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:18,452 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:18,452 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:18,452 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:35:18,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:18,452 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 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:18,461 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:35:18,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:35:18,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-12-03 16:35:18,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:18,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:18,906 INFO L134 CoverageAnalysis]: Checked inductivity of 12075 backedges. 9660 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:18,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 12075 backedges. 9660 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:24,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:24,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141, 141, 141] total 141 [2018-12-03 16:35:24,550 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:24,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-03 16:35:24,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-03 16:35:24,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5111, Invalid=14911, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:35:24,552 INFO L87 Difference]: Start difference. First operand 355 states and 357 transitions. Second operand 142 states. [2018-12-03 16:35:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:31,160 INFO L93 Difference]: Finished difference Result 643 states and 647 transitions. [2018-12-03 16:35:31,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-12-03 16:35:31,161 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 352 [2018-12-03 16:35:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:31,161 INFO L225 Difference]: With dead ends: 643 [2018-12-03 16:35:31,161 INFO L226 Difference]: Without dead ends: 356 [2018-12-03 16:35:31,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 564 SyntacticMatches, 139 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16767 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=10221, Invalid=34511, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:35:31,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-12-03 16:35:31,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-12-03 16:35:31,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-03 16:35:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 358 transitions. [2018-12-03 16:35:31,209 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 358 transitions. Word has length 352 [2018-12-03 16:35:31,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:31,209 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 358 transitions. [2018-12-03 16:35:31,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-03 16:35:31,209 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 358 transitions. [2018-12-03 16:35:31,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-12-03 16:35:31,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:31,210 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1, 1, 1, 1] [2018-12-03 16:35:31,210 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:31,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:31,210 INFO L82 PathProgramCache]: Analyzing trace with hash 809882293, now seen corresponding path program 138 times [2018-12-03 16:35:31,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:31,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:31,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:31,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:31,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:31,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12145 backedges. 2623 proven. 9522 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:33,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:33,640 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:33,640 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:33,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:35:33,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:33,640 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 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:33,649 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:35:33,649 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:35:33,823 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:35:33,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:35:33,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:33,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12145 backedges. 2623 proven. 9522 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:33,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 12145 backedges. 2623 proven. 9522 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:37,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:37,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 72 [2018-12-03 16:35:37,688 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:37,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:35:37,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:35:37,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 16:35:37,689 INFO L87 Difference]: Start difference. First operand 356 states and 358 transitions. Second operand 73 states. [2018-12-03 16:35:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:38,152 INFO L93 Difference]: Finished difference Result 370 states and 373 transitions. [2018-12-03 16:35:38,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:35:38,152 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 353 [2018-12-03 16:35:38,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:38,153 INFO L225 Difference]: With dead ends: 370 [2018-12-03 16:35:38,153 INFO L226 Difference]: Without dead ends: 364 [2018-12-03 16:35:38,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 634 SyntacticMatches, 140 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 16:35:38,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-12-03 16:35:38,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 360. [2018-12-03 16:35:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-03 16:35:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 362 transitions. [2018-12-03 16:35:38,200 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 362 transitions. Word has length 353 [2018-12-03 16:35:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:38,201 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 362 transitions. [2018-12-03 16:35:38,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:35:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 362 transitions. [2018-12-03 16:35:38,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-12-03 16:35:38,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:38,202 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 70, 70, 70, 1, 1, 1, 1, 1] [2018-12-03 16:35:38,202 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:38,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:38,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1372611499, now seen corresponding path program 139 times [2018-12-03 16:35:38,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:38,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:38,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:35:38,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:38,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:44,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12425 backedges. 9940 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:44,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:44,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:35:44,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:35:44,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 16:35:44,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:35:44,247 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 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:35:44,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:44,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:35:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:35:44,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:35:44,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12425 backedges. 9940 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:44,548 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:35:50,254 INFO L134 CoverageAnalysis]: Checked inductivity of 12425 backedges. 9940 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:35:50,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:35:50,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143, 143, 143] total 143 [2018-12-03 16:35:50,275 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:35:50,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-03 16:35:50,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-03 16:35:50,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=15337, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:35:50,276 INFO L87 Difference]: Start difference. First operand 360 states and 362 transitions. Second operand 144 states. [2018-12-03 16:35:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:35:57,841 INFO L93 Difference]: Finished difference Result 652 states and 656 transitions. [2018-12-03 16:35:57,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-12-03 16:35:57,841 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 357 [2018-12-03 16:35:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:35:57,842 INFO L225 Difference]: With dead ends: 652 [2018-12-03 16:35:57,842 INFO L226 Difference]: Without dead ends: 361 [2018-12-03 16:35:57,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 572 SyntacticMatches, 141 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17255 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=10509, Invalid=35501, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 16:35:57,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-12-03 16:35:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2018-12-03 16:35:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-03 16:35:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 363 transitions. [2018-12-03 16:35:57,890 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 363 transitions. Word has length 357 [2018-12-03 16:35:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:35:57,890 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 363 transitions. [2018-12-03 16:35:57,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-03 16:35:57,891 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 363 transitions. [2018-12-03 16:35:57,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-12-03 16:35:57,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:35:57,892 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1, 1, 1, 1] [2018-12-03 16:35:57,892 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:35:57,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:35:57,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1421756370, now seen corresponding path program 140 times [2018-12-03 16:35:57,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:35:57,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:57,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:35:57,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:35:57,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:35:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:00,327 INFO L134 CoverageAnalysis]: Checked inductivity of 12496 backedges. 2696 proven. 9800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:00,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:00,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:00,328 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:00,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:00,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:00,328 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 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:00,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:36:00,336 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:36:00,705 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 71 check-sat command(s) [2018-12-03 16:36:00,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:36:00,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 12496 backedges. 2696 proven. 9800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:00,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12496 backedges. 2696 proven. 9800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:04,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:04,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 73 [2018-12-03 16:36:04,792 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:04,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:36:04,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:36:04,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:36:04,794 INFO L87 Difference]: Start difference. First operand 361 states and 363 transitions. Second operand 74 states. [2018-12-03 16:36:05,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:05,255 INFO L93 Difference]: Finished difference Result 375 states and 378 transitions. [2018-12-03 16:36:05,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:36:05,255 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 358 [2018-12-03 16:36:05,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:05,256 INFO L225 Difference]: With dead ends: 375 [2018-12-03 16:36:05,256 INFO L226 Difference]: Without dead ends: 369 [2018-12-03 16:36:05,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 857 GetRequests, 643 SyntacticMatches, 142 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5041 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:36:05,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-12-03 16:36:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 365. [2018-12-03 16:36:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-12-03 16:36:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 367 transitions. [2018-12-03 16:36:05,328 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 367 transitions. Word has length 358 [2018-12-03 16:36:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:05,328 INFO L480 AbstractCegarLoop]: Abstraction has 365 states and 367 transitions. [2018-12-03 16:36:05,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:36:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 367 transitions. [2018-12-03 16:36:05,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-12-03 16:36:05,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:05,330 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 71, 71, 71, 1, 1, 1, 1, 1] [2018-12-03 16:36:05,330 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:05,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:05,330 INFO L82 PathProgramCache]: Analyzing trace with hash -325123512, now seen corresponding path program 141 times [2018-12-03 16:36:05,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:05,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:05,331 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:05,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:05,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:11,518 INFO L134 CoverageAnalysis]: Checked inductivity of 12780 backedges. 10224 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:11,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:11,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:11,519 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:11,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:11,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:11,519 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 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:11,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:36:11,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:36:11,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:36:11,709 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:36:11,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 12780 backedges. 10224 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:11,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12780 backedges. 10224 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:17,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:17,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145, 145, 145] total 145 [2018-12-03 16:36:17,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:17,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-03 16:36:17,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-03 16:36:17,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5401, Invalid=15769, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:36:17,908 INFO L87 Difference]: Start difference. First operand 365 states and 367 transitions. Second operand 146 states. [2018-12-03 16:36:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:26,356 INFO L93 Difference]: Finished difference Result 661 states and 665 transitions. [2018-12-03 16:36:26,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-12-03 16:36:26,356 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 362 [2018-12-03 16:36:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:26,357 INFO L225 Difference]: With dead ends: 661 [2018-12-03 16:36:26,357 INFO L226 Difference]: Without dead ends: 366 [2018-12-03 16:36:26,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 939 GetRequests, 580 SyntacticMatches, 143 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17750 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=10801, Invalid=36505, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:36:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-03 16:36:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2018-12-03 16:36:26,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-12-03 16:36:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 368 transitions. [2018-12-03 16:36:26,432 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 368 transitions. Word has length 362 [2018-12-03 16:36:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:26,432 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 368 transitions. [2018-12-03 16:36:26,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-03 16:36:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 368 transitions. [2018-12-03 16:36:26,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-12-03 16:36:26,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:26,434 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1, 1, 1, 1] [2018-12-03 16:36:26,435 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:26,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:26,435 INFO L82 PathProgramCache]: Analyzing trace with hash 156016257, now seen corresponding path program 142 times [2018-12-03 16:36:26,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:26,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:26,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:26,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:26,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12852 backedges. 2770 proven. 10082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:28,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:28,855 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:28,856 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:28,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:28,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:28,856 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 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:28,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:28,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:36:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:29,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:29,161 INFO L134 CoverageAnalysis]: Checked inductivity of 12852 backedges. 2770 proven. 10082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:29,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12852 backedges. 2770 proven. 10082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:33,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:33,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 74 [2018-12-03 16:36:33,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:33,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:36:33,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:36:33,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:36:33,310 INFO L87 Difference]: Start difference. First operand 366 states and 368 transitions. Second operand 75 states. [2018-12-03 16:36:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:33,789 INFO L93 Difference]: Finished difference Result 380 states and 383 transitions. [2018-12-03 16:36:33,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:36:33,789 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 363 [2018-12-03 16:36:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:33,790 INFO L225 Difference]: With dead ends: 380 [2018-12-03 16:36:33,790 INFO L226 Difference]: Without dead ends: 374 [2018-12-03 16:36:33,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 869 GetRequests, 652 SyntacticMatches, 144 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5184 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 16:36:33,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-12-03 16:36:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 370. [2018-12-03 16:36:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-12-03 16:36:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 372 transitions. [2018-12-03 16:36:33,839 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 372 transitions. Word has length 363 [2018-12-03 16:36:33,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:33,839 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 372 transitions. [2018-12-03 16:36:33,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:36:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 372 transitions. [2018-12-03 16:36:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-12-03 16:36:33,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:33,841 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 72, 72, 72, 1, 1, 1, 1, 1] [2018-12-03 16:36:33,841 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:33,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:33,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1874094455, now seen corresponding path program 143 times [2018-12-03 16:36:33,841 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:33,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:33,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:36:33,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:33,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:36:40,395 INFO L134 CoverageAnalysis]: Checked inductivity of 13140 backedges. 10512 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:40,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:40,395 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:36:40,396 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:36:40,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:36:40,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:36:40,396 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 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:36:40,405 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:36:40,405 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:36:40,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2018-12-03 16:36:40,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:36:40,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:36:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 13140 backedges. 10512 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:40,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:36:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 13140 backedges. 10512 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:36:47,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:36:47,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147, 147, 147] total 147 [2018-12-03 16:36:47,128 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:36:47,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-03 16:36:47,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-03 16:36:47,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5549, Invalid=16207, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:36:47,129 INFO L87 Difference]: Start difference. First operand 370 states and 372 transitions. Second operand 148 states. [2018-12-03 16:36:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:36:55,757 INFO L93 Difference]: Finished difference Result 670 states and 674 transitions. [2018-12-03 16:36:55,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-12-03 16:36:55,757 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 367 [2018-12-03 16:36:55,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:36:55,758 INFO L225 Difference]: With dead ends: 670 [2018-12-03 16:36:55,758 INFO L226 Difference]: Without dead ends: 371 [2018-12-03 16:36:55,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 952 GetRequests, 588 SyntacticMatches, 145 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18252 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=11097, Invalid=37523, Unknown=0, NotChecked=0, Total=48620 [2018-12-03 16:36:55,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-12-03 16:36:55,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2018-12-03 16:36:55,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-12-03 16:36:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 373 transitions. [2018-12-03 16:36:55,808 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 373 transitions. Word has length 367 [2018-12-03 16:36:55,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:36:55,808 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 373 transitions. [2018-12-03 16:36:55,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-03 16:36:55,808 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 373 transitions. [2018-12-03 16:36:55,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-12-03 16:36:55,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:36:55,810 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1, 1, 1, 1] [2018-12-03 16:36:55,810 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:36:55,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:36:55,810 INFO L82 PathProgramCache]: Analyzing trace with hash -865302306, now seen corresponding path program 144 times [2018-12-03 16:36:55,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:36:55,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:55,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:36:55,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:36:55,811 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:36:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat