java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-299a4a8 [2018-12-04 11:42:47,985 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-04 11:42:47,988 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-04 11:42:47,999 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-04 11:42:48,000 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-04 11:42:48,001 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-04 11:42:48,002 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-04 11:42:48,004 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-04 11:42:48,006 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-04 11:42:48,007 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-04 11:42:48,008 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-04 11:42:48,008 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-04 11:42:48,009 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-04 11:42:48,010 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-04 11:42:48,011 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-04 11:42:48,012 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-04 11:42:48,013 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-04 11:42:48,015 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-04 11:42:48,017 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-04 11:42:48,019 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-04 11:42:48,020 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-04 11:42:48,022 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-04 11:42:48,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-04 11:42:48,025 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-04 11:42:48,025 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-04 11:42:48,026 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-04 11:42:48,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-04 11:42:48,028 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-04 11:42:48,029 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-04 11:42:48,030 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-04 11:42:48,031 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-04 11:42:48,031 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-04 11:42:48,032 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-04 11:42:48,032 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-04 11:42:48,033 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-04 11:42:48,034 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-04 11:42:48,034 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-04 11:42:48,047 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-04 11:42:48,048 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-04 11:42:48,048 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-04 11:42:48,049 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-04 11:42:48,049 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-04 11:42:48,049 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-04 11:42:48,049 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-04 11:42:48,049 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-04 11:42:48,050 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-04 11:42:48,050 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-04 11:42:48,050 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-04 11:42:48,050 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-04 11:42:48,050 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-04 11:42:48,051 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-04 11:42:48,051 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-04 11:42:48,051 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-04 11:42:48,052 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-04 11:42:48,052 INFO L133 SettingsManager]: * Use SBE=true [2018-12-04 11:42:48,052 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-04 11:42:48,052 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-04 11:42:48,052 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-04 11:42:48,053 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-04 11:42:48,053 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-04 11:42:48,053 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-04 11:42:48,053 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-04 11:42:48,053 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-04 11:42:48,054 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-04 11:42:48,054 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-04 11:42:48,054 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-04 11:42:48,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-04 11:42:48,055 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-04 11:42:48,055 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-04 11:42:48,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-04 11:42:48,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-04 11:42:48,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-04 11:42:48,056 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-04 11:42:48,056 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-04 11:42:48,056 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-04 11:42:48,056 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-04 11:42:48,056 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-04 11:42:48,056 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-04 11:42:48,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-04 11:42:48,100 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-04 11:42:48,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-04 11:42:48,104 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-04 11:42:48,105 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-04 11:42:48,105 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2018-12-04 11:42:48,106 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2018-12-04 11:42:48,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-04 11:42:48,148 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-04 11:42:48,149 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-04 11:42:48,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-04 11:42:48,150 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-04 11:42:48,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,180 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-04 11:42:48,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-04 11:42:48,193 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-04 11:42:48,193 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-04 11:42:48,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,209 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,215 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/1) ... [2018-12-04 11:42:48,220 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-04 11:42:48,221 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-04 11:42:48,221 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-04 11:42:48,221 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-04 11:42:48,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (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-04 11:42:48,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-04 11:42:48,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-04 11:42:48,603 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-04 11:42:48,604 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-04 11:42:48,604 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:42:48 BoogieIcfgContainer [2018-12-04 11:42:48,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-04 11:42:48,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-04 11:42:48,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-04 11:42:48,609 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-04 11:42:48,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.12 11:42:48" (1/2) ... [2018-12-04 11:42:48,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ba6e6f and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.12 11:42:48, skipping insertion in model container [2018-12-04 11:42:48,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.12 11:42:48" (2/2) ... [2018-12-04 11:42:48,614 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2018-12-04 11:42:48,626 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-04 11:42:48,636 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-04 11:42:48,655 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-04 11:42:48,700 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-04 11:42:48,700 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-04 11:42:48,700 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-04 11:42:48,701 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-04 11:42:48,701 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-04 11:42:48,701 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-04 11:42:48,701 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-04 11:42:48,701 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-04 11:42:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-04 11:42:48,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-04 11:42:48,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:48,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-04 11:42:48,737 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:48,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:48,749 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2018-12-04 11:42:48,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:48,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:48,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:48,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:48,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:48,918 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-04 11:42:48,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:42:48,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-04 11:42:48,921 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:42:48,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-04 11:42:48,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-04 11:42:48,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-04 11:42:48,951 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-04 11:42:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:49,055 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2018-12-04 11:42:49,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-04 11:42:49,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-04 11:42:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:49,071 INFO L225 Difference]: With dead ends: 10 [2018-12-04 11:42:49,071 INFO L226 Difference]: Without dead ends: 6 [2018-12-04 11:42:49,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-04 11:42:49,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-04 11:42:49,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-04 11:42:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-04 11:42:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-12-04 11:42:49,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2018-12-04 11:42:49,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:49,116 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-12-04 11:42:49,116 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-04 11:42:49,117 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2018-12-04 11:42:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-04 11:42:49,117 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:49,117 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-04 11:42:49,118 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:49,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,118 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2018-12-04 11:42:49,118 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:49,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:49,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,120 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,224 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-04 11:42:49,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-04 11:42:49,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-04 11:42:49,224 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-04 11:42:49,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-04 11:42:49,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-04 11:42:49,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-04 11:42:49,227 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2018-12-04 11:42:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:49,292 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-12-04 11:42:49,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-04 11:42:49,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-12-04 11:42:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:49,294 INFO L225 Difference]: With dead ends: 11 [2018-12-04 11:42:49,294 INFO L226 Difference]: Without dead ends: 7 [2018-12-04 11:42:49,295 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-04 11:42:49,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-04 11:42:49,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-04 11:42:49,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-04 11:42:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2018-12-04 11:42:49,305 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2018-12-04 11:42:49,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:49,305 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-12-04 11:42:49,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-04 11:42:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2018-12-04 11:42:49,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-04 11:42:49,306 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:49,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-04 11:42:49,307 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:49,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,307 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2018-12-04 11:42:49,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:49,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:49,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:49,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:49,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:49,529 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:49,530 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-04 11:42:49,532 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2018-12-04 11:42:49,580 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-04 11:42:49,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-04 11:42:49,755 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-04 11:42:49,757 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 5 times. Never widened. Performed 274 root evaluator evaluations with a maximum evaluation depth of 4. Performed 274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-04 11:42:49,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:49,769 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-04 11:42:49,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:49,769 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-04 11:42:49,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:49,780 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:49,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:50,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:42:50,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:50,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:50,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:42:50,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:50,379 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:50,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:42:50,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:50,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:50,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:42:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:50,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:50,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-04 11:42:50,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:50,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-04 11:42:50,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-04 11:42:50,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-04 11:42:50,534 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2018-12-04 11:42:50,732 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-12-04 11:42:50,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:50,941 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2018-12-04 11:42:50,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-04 11:42:50,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-04 11:42:50,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:50,944 INFO L225 Difference]: With dead ends: 12 [2018-12-04 11:42:50,945 INFO L226 Difference]: Without dead ends: 8 [2018-12-04 11:42:50,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:42:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-04 11:42:50,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-04 11:42:50,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-04 11:42:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2018-12-04 11:42:50,949 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2018-12-04 11:42:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:50,950 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2018-12-04 11:42:50,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-04 11:42:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2018-12-04 11:42:50,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-04 11:42:50,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:50,951 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-04 11:42:50,951 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:50,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:50,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2018-12-04 11:42:50,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:50,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:50,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:50,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:51,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:51,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,036 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:51,036 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:51,036 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:51,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,038 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-04 11:42:51,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:51,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:51,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-04 11:42:51,094 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:51,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:51,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:51,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:51,171 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:51,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:51,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2018-12-04 11:42:51,191 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:51,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-04 11:42:51,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-04 11:42:51,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-04 11:42:51,192 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2018-12-04 11:42:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:51,553 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2018-12-04 11:42:51,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-04 11:42:51,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-12-04 11:42:51,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:51,557 INFO L225 Difference]: With dead ends: 11 [2018-12-04 11:42:51,558 INFO L226 Difference]: Without dead ends: 9 [2018-12-04 11:42:51,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-04 11:42:51,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-04 11:42:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-04 11:42:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-04 11:42:51,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-04 11:42:51,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2018-12-04 11:42:51,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:51,629 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-04 11:42:51,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-04 11:42:51,630 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-04 11:42:51,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-04 11:42:51,630 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:51,630 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2018-12-04 11:42:51,631 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:51,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:51,631 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2018-12-04 11:42:51,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,633 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:51,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:51,836 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 10 [2018-12-04 11:42:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:51,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,901 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:51,902 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:51,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:51,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:51,903 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-04 11:42:51,912 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:51,912 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:51,937 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:51,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:51,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:52,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:42:52,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:52,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:52,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:42:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:42:52,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:52,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:42:52,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:52,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:52,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:42:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-04 11:42:52,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:52,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2018-12-04 11:42:52,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:52,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 11:42:52,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 11:42:52,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-12-04 11:42:52,459 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2018-12-04 11:42:52,812 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-12-04 11:42:52,973 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-12-04 11:42:53,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:53,207 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-04 11:42:53,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-04 11:42:53,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2018-12-04 11:42:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:53,209 INFO L225 Difference]: With dead ends: 17 [2018-12-04 11:42:53,209 INFO L226 Difference]: Without dead ends: 11 [2018-12-04 11:42:53,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2018-12-04 11:42:53,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-04 11:42:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-04 11:42:53,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-04 11:42:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-04 11:42:53,215 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-04 11:42:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:53,216 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-04 11:42:53,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 11:42:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-04 11:42:53,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-04 11:42:53,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:53,217 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2018-12-04 11:42:53,217 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:53,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:53,218 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2018-12-04 11:42:53,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:53,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,219 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:53,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:53,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:53,393 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:53,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,394 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:53,394 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:53,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:53,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:53,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 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-04 11:42:53,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:53,404 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:53,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:53,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:42:53,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:53,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:53,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:42:53,593 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:53,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:53,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:42:53,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:53,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:53,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:42:53,805 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:53,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:53,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2018-12-04 11:42:53,824 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:53,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-04 11:42:53,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-04 11:42:53,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2018-12-04 11:42:53,826 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2018-12-04 11:42:54,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:54,302 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-12-04 11:42:54,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-04 11:42:54,303 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2018-12-04 11:42:54,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:54,303 INFO L225 Difference]: With dead ends: 18 [2018-12-04 11:42:54,303 INFO L226 Difference]: Without dead ends: 12 [2018-12-04 11:42:54,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:42:54,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-04 11:42:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-04 11:42:54,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-04 11:42:54,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-04 11:42:54,309 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2018-12-04 11:42:54,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:54,309 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-04 11:42:54,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-04 11:42:54,309 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-04 11:42:54,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-04 11:42:54,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:54,310 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2018-12-04 11:42:54,310 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:54,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:54,310 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2018-12-04 11:42:54,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:54,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:54,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:54,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:54,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:54,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:54,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:54,399 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:54,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:54,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:54,400 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-04 11:42:54,408 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:54,409 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:54,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-04 11:42:54,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:54,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:54,440 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:54,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:54,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:54,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-12-04 11:42:54,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:54,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-04 11:42:54,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-04 11:42:54,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-04 11:42:54,533 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2018-12-04 11:42:54,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:54,669 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-04 11:42:54,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-04 11:42:54,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-12-04 11:42:54,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:54,671 INFO L225 Difference]: With dead ends: 15 [2018-12-04 11:42:54,672 INFO L226 Difference]: Without dead ends: 13 [2018-12-04 11:42:54,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-04 11:42:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-04 11:42:54,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-04 11:42:54,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-04 11:42:54,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-12-04 11:42:54,678 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2018-12-04 11:42:54,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:54,678 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-04 11:42:54,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-04 11:42:54,679 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-12-04 11:42:54,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-04 11:42:54,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:54,679 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2018-12-04 11:42:54,680 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:54,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:54,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2018-12-04 11:42:54,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:54,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:54,681 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:54,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:54,682 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:54,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:54,928 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:54,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:54,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:54,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:54,930 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-04 11:42:54,949 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:54,949 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:54,964 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:54,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:54,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:55,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:42:55,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:55,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:55,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:42:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:42:55,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:55,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:42:55,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:55,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:55,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:42:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-04 11:42:55,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:55,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2018-12-04 11:42:55,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:55,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 11:42:55,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 11:42:55,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:42:55,362 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2018-12-04 11:42:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:56,115 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2018-12-04 11:42:56,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-04 11:42:56,115 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2018-12-04 11:42:56,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:56,116 INFO L225 Difference]: With dead ends: 23 [2018-12-04 11:42:56,116 INFO L226 Difference]: Without dead ends: 15 [2018-12-04 11:42:56,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2018-12-04 11:42:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-04 11:42:56,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-04 11:42:56,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-04 11:42:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-04 11:42:56,124 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-12-04 11:42:56,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:56,124 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-04 11:42:56,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 11:42:56,124 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-04 11:42:56,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-04 11:42:56,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:56,125 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2018-12-04 11:42:56,125 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:56,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:56,126 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2018-12-04 11:42:56,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:56,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:56,127 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:56,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:56,127 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:56,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:56,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:56,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:56,389 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:56,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:56,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:56,390 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-04 11:42:56,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:56,401 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:42:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:56,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:56,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:42:56,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:56,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:56,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:42:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:56,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:56,919 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:42:56,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:56,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:56,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:42:56,952 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:56,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:56,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2018-12-04 11:42:56,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:56,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-04 11:42:56,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-04 11:42:56,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-12-04 11:42:56,973 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2018-12-04 11:42:57,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:57,892 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2018-12-04 11:42:57,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-04 11:42:57,892 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2018-12-04 11:42:57,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:57,894 INFO L225 Difference]: With dead ends: 24 [2018-12-04 11:42:57,894 INFO L226 Difference]: Without dead ends: 16 [2018-12-04 11:42:57,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:42:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-04 11:42:57,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-04 11:42:57,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-04 11:42:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-12-04 11:42:57,901 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2018-12-04 11:42:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:57,901 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-12-04 11:42:57,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-04 11:42:57,901 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-12-04 11:42:57,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-04 11:42:57,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:57,902 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2018-12-04 11:42:57,902 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:57,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:57,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2018-12-04 11:42:57,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:57,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:57,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:42:57,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:57,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:58,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:58,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:58,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:58,133 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:58,133 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:58,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:58,133 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-04 11:42:58,145 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:42:58,145 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:42:58,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-04 11:42:58,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:58,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:58,238 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:58,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:58,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:58,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2018-12-04 11:42:58,493 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:58,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-04 11:42:58,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-04 11:42:58,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-04 11:42:58,494 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2018-12-04 11:42:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:42:58,609 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-12-04 11:42:58,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-04 11:42:58,611 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-12-04 11:42:58,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:42:58,612 INFO L225 Difference]: With dead ends: 19 [2018-12-04 11:42:58,612 INFO L226 Difference]: Without dead ends: 17 [2018-12-04 11:42:58,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2018-12-04 11:42:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-04 11:42:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-04 11:42:58,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-04 11:42:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-12-04 11:42:58,620 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2018-12-04 11:42:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:42:58,620 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-12-04 11:42:58,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-04 11:42:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-12-04 11:42:58,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-04 11:42:58,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:42:58,621 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2018-12-04 11:42:58,622 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:42:58,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:42:58,622 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2018-12-04 11:42:58,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:42:58,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:58,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:42:58,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:42:58,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:42:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:42:58,961 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:42:58,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:58,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:42:58,963 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:42:58,963 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:42:58,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:42:58,963 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-04 11:42:58,992 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:42:58,993 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:42:59,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:42:59,008 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:42:59,010 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:42:59,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:42:59,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:59,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:59,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:42:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:42:59,208 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:42:59,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:42:59,269 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:42:59,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:42:59,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:42:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-12-04 11:42:59,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:42:59,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2018-12-04 11:42:59,487 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:42:59,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 11:42:59,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 11:42:59,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2018-12-04 11:42:59,488 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2018-12-04 11:43:00,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:00,515 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2018-12-04 11:43:00,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-04 11:43:00,516 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2018-12-04 11:43:00,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:00,517 INFO L225 Difference]: With dead ends: 29 [2018-12-04 11:43:00,517 INFO L226 Difference]: Without dead ends: 19 [2018-12-04 11:43:00,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2018-12-04 11:43:00,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-04 11:43:00,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-04 11:43:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-04 11:43:00,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-04 11:43:00,525 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-12-04 11:43:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:00,525 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-04 11:43:00,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 11:43:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-04 11:43:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-04 11:43:00,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:00,526 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2018-12-04 11:43:00,526 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:00,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2018-12-04 11:43:00,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:00,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:00,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:00,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:00,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:00,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:00,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:00,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:00,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:00,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:00,955 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-04 11:43:00,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:00,964 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:00,993 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:01,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:01,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:01,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:01,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:01,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:01,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:01,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:01,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:01,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:43:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:01,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:01,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2018-12-04 11:43:01,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:01,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-04 11:43:01,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-04 11:43:01,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2018-12-04 11:43:01,354 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2018-12-04 11:43:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:02,245 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-12-04 11:43:02,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-04 11:43:02,246 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2018-12-04 11:43:02,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:02,247 INFO L225 Difference]: With dead ends: 30 [2018-12-04 11:43:02,247 INFO L226 Difference]: Without dead ends: 20 [2018-12-04 11:43:02,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:43:02,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-04 11:43:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-04 11:43:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-04 11:43:02,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-12-04 11:43:02,254 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2018-12-04 11:43:02,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:02,254 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-12-04 11:43:02,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-04 11:43:02,255 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-12-04 11:43:02,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-04 11:43:02,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:02,255 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2018-12-04 11:43:02,255 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:02,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:02,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2018-12-04 11:43:02,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:02,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:02,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:02,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:02,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:02,389 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:02,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:02,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:02,390 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:02,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:02,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:02,390 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-04 11:43:02,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:02,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:02,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-04 11:43:02,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:02,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:02,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:02,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:02,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2018-12-04 11:43:02,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:02,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-04 11:43:02,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-04 11:43:02,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-12-04 11:43:02,564 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2018-12-04 11:43:02,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:02,992 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-12-04 11:43:02,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-04 11:43:02,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-12-04 11:43:02,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:02,994 INFO L225 Difference]: With dead ends: 23 [2018-12-04 11:43:02,994 INFO L226 Difference]: Without dead ends: 21 [2018-12-04 11:43:02,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2018-12-04 11:43:02,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-04 11:43:03,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-04 11:43:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-04 11:43:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-04 11:43:03,002 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2018-12-04 11:43:03,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:03,002 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-04 11:43:03,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-04 11:43:03,003 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-04 11:43:03,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-04 11:43:03,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:03,003 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2018-12-04 11:43:03,004 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:03,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:03,004 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2018-12-04 11:43:03,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:03,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:03,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:03,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:03,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:03,283 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:03,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:03,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:03,284 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:03,284 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:03,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:03,284 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-04 11:43:03,293 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:03,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:03,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:03,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:03,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:03,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:03,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:03,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:03,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:43:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:43:03,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:03,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:03,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:03,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:03,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:43:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-04 11:43:04,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:04,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2018-12-04 11:43:04,025 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:04,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 11:43:04,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 11:43:04,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2018-12-04 11:43:04,027 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2018-12-04 11:43:05,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:05,347 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-12-04 11:43:05,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-04 11:43:05,348 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2018-12-04 11:43:05,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:05,349 INFO L225 Difference]: With dead ends: 35 [2018-12-04 11:43:05,349 INFO L226 Difference]: Without dead ends: 23 [2018-12-04 11:43:05,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2018-12-04 11:43:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-04 11:43:05,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-04 11:43:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-04 11:43:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-12-04 11:43:05,358 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-12-04 11:43:05,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:05,358 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-12-04 11:43:05,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 11:43:05,358 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-12-04 11:43:05,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-04 11:43:05,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:05,359 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2018-12-04 11:43:05,359 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:05,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:05,360 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2018-12-04 11:43:05,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:05,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:05,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:05,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:05,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:05,985 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:05,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:05,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:05,986 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:05,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:05,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:05,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 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-04 11:43:05,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:05,996 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:06,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:06,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:06,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:06,404 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:06,404 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:06,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:06,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:06,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:06,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:06,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:43:06,617 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:06,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:06,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2018-12-04 11:43:06,636 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:06,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-04 11:43:06,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-04 11:43:06,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-12-04 11:43:06,637 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2018-12-04 11:43:07,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:07,638 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-04 11:43:07,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-04 11:43:07,639 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2018-12-04 11:43:07,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:07,640 INFO L225 Difference]: With dead ends: 36 [2018-12-04 11:43:07,640 INFO L226 Difference]: Without dead ends: 24 [2018-12-04 11:43:07,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:43:07,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-04 11:43:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-04 11:43:07,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-04 11:43:07,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-04 11:43:07,650 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2018-12-04 11:43:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:07,650 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-04 11:43:07,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-04 11:43:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-04 11:43:07,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-04 11:43:07,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:07,651 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2018-12-04 11:43:07,651 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:07,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:07,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2018-12-04 11:43:07,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:07,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:07,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:07,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:07,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:07,929 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:07,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:07,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:07,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:07,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:07,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:07,930 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-04 11:43:07,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:07,938 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:07,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-04 11:43:07,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:07,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:07,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:08,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:08,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2018-12-04 11:43:08,125 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:08,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-04 11:43:08,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-04 11:43:08,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-12-04 11:43:08,125 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2018-12-04 11:43:08,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:08,261 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-04 11:43:08,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-04 11:43:08,262 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-12-04 11:43:08,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:08,263 INFO L225 Difference]: With dead ends: 27 [2018-12-04 11:43:08,263 INFO L226 Difference]: Without dead ends: 25 [2018-12-04 11:43:08,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2018-12-04 11:43:08,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-04 11:43:08,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-04 11:43:08,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-04 11:43:08,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-04 11:43:08,274 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2018-12-04 11:43:08,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:08,275 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-04 11:43:08,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-04 11:43:08,275 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-04 11:43:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-04 11:43:08,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:08,276 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2018-12-04 11:43:08,276 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:08,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2018-12-04 11:43:08,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:08,277 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:08,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:08,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:08,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:08,837 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:08,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:08,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:08,837 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-04 11:43:08,847 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:08,847 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:08,863 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:08,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:08,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:09,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:09,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:09,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:09,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:43:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:43:09,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:09,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:09,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:09,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:09,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:43:09,687 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-12-04 11:43:09,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:09,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2018-12-04 11:43:09,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:09,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-04 11:43:09,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-04 11:43:09,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:43:09,709 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2018-12-04 11:43:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:11,372 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-12-04 11:43:11,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-04 11:43:11,373 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2018-12-04 11:43:11,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:11,374 INFO L225 Difference]: With dead ends: 41 [2018-12-04 11:43:11,374 INFO L226 Difference]: Without dead ends: 27 [2018-12-04 11:43:11,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2018-12-04 11:43:11,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-04 11:43:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-04 11:43:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-04 11:43:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-04 11:43:11,391 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-04 11:43:11,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:11,392 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-04 11:43:11,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-04 11:43:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-04 11:43:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-04 11:43:11,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:11,393 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2018-12-04 11:43:11,393 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:11,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:11,394 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2018-12-04 11:43:11,394 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:11,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:11,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:11,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:11,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:11,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:11,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:11,934 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:11,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:11,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:11,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 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-04 11:43:11,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:11,944 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:11,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:11,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:12,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:12,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:12,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:12,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:12,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:12,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:12,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:12,725 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:12,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:43:12,819 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:12,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:12,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2018-12-04 11:43:12,839 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:12,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-04 11:43:12,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-04 11:43:12,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2018-12-04 11:43:12,840 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2018-12-04 11:43:14,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:14,017 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-12-04 11:43:14,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-04 11:43:14,017 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2018-12-04 11:43:14,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:14,018 INFO L225 Difference]: With dead ends: 42 [2018-12-04 11:43:14,018 INFO L226 Difference]: Without dead ends: 28 [2018-12-04 11:43:14,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:43:14,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-04 11:43:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-04 11:43:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-04 11:43:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-12-04 11:43:14,029 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2018-12-04 11:43:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:14,029 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-12-04 11:43:14,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-04 11:43:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-12-04 11:43:14,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-04 11:43:14,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:14,030 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2018-12-04 11:43:14,030 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:14,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:14,030 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2018-12-04 11:43:14,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:14,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:14,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:14,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:14,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:14,235 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:14,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:14,236 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:14,236 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:14,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:14,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:14,236 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-04 11:43:14,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:14,249 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:14,287 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-04 11:43:14,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:14,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:14,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:14,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:14,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2018-12-04 11:43:14,626 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:14,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-04 11:43:14,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-04 11:43:14,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2018-12-04 11:43:14,627 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2018-12-04 11:43:14,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:14,858 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-12-04 11:43:14,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-04 11:43:14,858 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-12-04 11:43:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:14,859 INFO L225 Difference]: With dead ends: 31 [2018-12-04 11:43:14,859 INFO L226 Difference]: Without dead ends: 29 [2018-12-04 11:43:14,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2018-12-04 11:43:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-04 11:43:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-04 11:43:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-04 11:43:14,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-04 11:43:14,869 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2018-12-04 11:43:14,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:14,870 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-04 11:43:14,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-04 11:43:14,870 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-04 11:43:14,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-04 11:43:14,870 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:14,870 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2018-12-04 11:43:14,871 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:14,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:14,871 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2018-12-04 11:43:14,871 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:14,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:14,872 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:14,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:14,872 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:15,358 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:15,358 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:15,358 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:15,359 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:15,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:15,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:15,359 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-04 11:43:15,367 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:15,367 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:15,384 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:15,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:15,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:15,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:15,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:15,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:15,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:43:16,037 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:43:16,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:16,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:16,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:16,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:16,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:43:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-12-04 11:43:16,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:16,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2018-12-04 11:43:16,644 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:16,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-04 11:43:16,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-04 11:43:16,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2018-12-04 11:43:16,646 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2018-12-04 11:43:17,787 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2018-12-04 11:43:18,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:18,917 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-12-04 11:43:18,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-04 11:43:18,918 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2018-12-04 11:43:18,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:18,918 INFO L225 Difference]: With dead ends: 47 [2018-12-04 11:43:18,919 INFO L226 Difference]: Without dead ends: 31 [2018-12-04 11:43:18,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2018-12-04 11:43:18,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-04 11:43:18,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-04 11:43:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-04 11:43:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-12-04 11:43:18,932 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-12-04 11:43:18,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:18,933 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-12-04 11:43:18,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-04 11:43:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-12-04 11:43:18,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-04 11:43:18,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:18,934 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2018-12-04 11:43:18,934 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:18,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:18,934 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2018-12-04 11:43:18,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:18,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:18,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:18,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:18,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:19,948 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:19,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:19,948 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:19,948 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:19,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:19,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:19,949 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-04 11:43:19,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:19,957 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:19,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:21,068 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:21,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:21,073 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:21,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:21,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:21,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:21,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:21,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:21,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:43:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:21,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:21,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2018-12-04 11:43:21,282 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:21,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-04 11:43:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-04 11:43:21,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2018-12-04 11:43:21,283 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2018-12-04 11:43:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:22,770 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-12-04 11:43:22,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-04 11:43:22,770 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2018-12-04 11:43:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:22,771 INFO L225 Difference]: With dead ends: 48 [2018-12-04 11:43:22,771 INFO L226 Difference]: Without dead ends: 32 [2018-12-04 11:43:22,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:43:22,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-04 11:43:22,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-04 11:43:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-04 11:43:22,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-12-04 11:43:22,786 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2018-12-04 11:43:22,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:22,786 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-12-04 11:43:22,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-04 11:43:22,786 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-12-04 11:43:22,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-04 11:43:22,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:22,787 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2018-12-04 11:43:22,787 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:22,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:22,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2018-12-04 11:43:22,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:22,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:22,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:22,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:22,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:23,013 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:23,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:23,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:23,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:23,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:23,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:23,014 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-04 11:43:23,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:23,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:23,068 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-04 11:43:23,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:23,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:23,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:23,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:23,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2018-12-04 11:43:23,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:23,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-04 11:43:23,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-04 11:43:23,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2018-12-04 11:43:23,290 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2018-12-04 11:43:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:23,495 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-12-04 11:43:23,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-04 11:43:23,497 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-12-04 11:43:23,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:23,498 INFO L225 Difference]: With dead ends: 35 [2018-12-04 11:43:23,498 INFO L226 Difference]: Without dead ends: 33 [2018-12-04 11:43:23,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2018-12-04 11:43:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-04 11:43:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-04 11:43:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-04 11:43:23,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-04 11:43:23,514 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2018-12-04 11:43:23,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:23,515 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-04 11:43:23,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-04 11:43:23,515 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-04 11:43:23,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-04 11:43:23,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:23,516 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2018-12-04 11:43:23,516 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:23,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:23,516 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2018-12-04 11:43:23,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:23,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:23,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:23,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:23,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:23,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:24,110 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:24,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:24,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:24,111 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:24,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:24,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:24,111 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-04 11:43:24,121 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:24,122 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:24,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:24,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:24,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:24,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:24,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:24,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:24,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:43:24,757 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:43:24,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:24,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:24,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:24,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:24,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:43:26,066 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2018-12-04 11:43:26,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:26,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2018-12-04 11:43:26,086 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:26,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 11:43:26,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 11:43:26,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2018-12-04 11:43:26,089 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2018-12-04 11:43:28,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:28,144 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-04 11:43:28,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-04 11:43:28,145 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2018-12-04 11:43:28,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:28,146 INFO L225 Difference]: With dead ends: 53 [2018-12-04 11:43:28,146 INFO L226 Difference]: Without dead ends: 35 [2018-12-04 11:43:28,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=925, Invalid=5555, Unknown=0, NotChecked=0, Total=6480 [2018-12-04 11:43:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-04 11:43:28,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-04 11:43:28,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-04 11:43:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-04 11:43:28,159 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-04 11:43:28,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:28,159 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-04 11:43:28,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 11:43:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-04 11:43:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-04 11:43:28,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:28,160 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2018-12-04 11:43:28,160 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:28,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:28,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2018-12-04 11:43:28,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:28,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:28,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:28,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:28,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:29,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:29,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:29,009 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:29,009 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:29,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:29,009 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-04 11:43:29,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:29,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:29,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:29,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:29,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:29,751 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:29,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:29,799 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:29,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:29,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:29,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:29,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:29,855 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:43:30,028 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:30,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:30,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-12-04 11:43:30,047 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:30,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-04 11:43:30,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-04 11:43:30,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2018-12-04 11:43:30,049 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2018-12-04 11:43:31,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:31,772 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-12-04 11:43:31,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-04 11:43:31,773 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2018-12-04 11:43:31,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:31,773 INFO L225 Difference]: With dead ends: 54 [2018-12-04 11:43:31,774 INFO L226 Difference]: Without dead ends: 36 [2018-12-04 11:43:31,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:43:31,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-04 11:43:31,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-04 11:43:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-04 11:43:31,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-12-04 11:43:31,792 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2018-12-04 11:43:31,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:31,792 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-12-04 11:43:31,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-04 11:43:31,792 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-12-04 11:43:31,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-04 11:43:31,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:31,793 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2018-12-04 11:43:31,793 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:31,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2018-12-04 11:43:31,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:31,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:31,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:31,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:31,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:32,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:32,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:32,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:32,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:32,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:32,033 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-04 11:43:32,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:32,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:32,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-04 11:43:32,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:32,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:32,100 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:32,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:32,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:32,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2018-12-04 11:43:32,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:32,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-04 11:43:32,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-04 11:43:32,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2018-12-04 11:43:32,355 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2018-12-04 11:43:32,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:32,723 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-12-04 11:43:32,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-04 11:43:32,723 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-12-04 11:43:32,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:32,724 INFO L225 Difference]: With dead ends: 39 [2018-12-04 11:43:32,724 INFO L226 Difference]: Without dead ends: 37 [2018-12-04 11:43:32,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2018-12-04 11:43:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-04 11:43:32,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-04 11:43:32,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-04 11:43:32,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-04 11:43:32,741 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2018-12-04 11:43:32,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:32,742 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-04 11:43:32,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-04 11:43:32,742 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-04 11:43:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-04 11:43:32,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:32,743 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2018-12-04 11:43:32,743 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:32,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:32,743 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2018-12-04 11:43:32,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:32,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:32,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:32,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:32,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:33,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:33,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:33,946 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:33,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:33,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:33,946 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-04 11:43:33,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:33,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:33,977 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:33,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:33,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:34,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:34,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:34,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:34,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:43:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:43:34,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:34,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:34,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:34,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:34,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:43:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2018-12-04 11:43:35,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:35,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2018-12-04 11:43:35,622 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:35,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 11:43:35,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 11:43:35,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:43:35,623 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2018-12-04 11:43:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:38,079 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-12-04 11:43:38,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-04 11:43:38,079 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2018-12-04 11:43:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:38,080 INFO L225 Difference]: With dead ends: 59 [2018-12-04 11:43:38,080 INFO L226 Difference]: Without dead ends: 39 [2018-12-04 11:43:38,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2018-12-04 11:43:38,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-04 11:43:38,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-04 11:43:38,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-04 11:43:38,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-12-04 11:43:38,097 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-12-04 11:43:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:38,097 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-12-04 11:43:38,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 11:43:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-12-04 11:43:38,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-04 11:43:38,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:38,098 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2018-12-04 11:43:38,098 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:38,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:38,098 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2018-12-04 11:43:38,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:38,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:38,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:38,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:38,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:39,331 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:39,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:39,331 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:39,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:39,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:39,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:39,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:43:39,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:39,340 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:39,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:40,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:40,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:40,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:40,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:40,328 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:40,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:40,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:40,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:40,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:43:40,590 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:40,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:40,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2018-12-04 11:43:40,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:40,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-04 11:43:40,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-04 11:43:40,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2018-12-04 11:43:40,610 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2018-12-04 11:43:42,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:42,653 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-04 11:43:42,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-04 11:43:42,653 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2018-12-04 11:43:42,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:42,654 INFO L225 Difference]: With dead ends: 60 [2018-12-04 11:43:42,654 INFO L226 Difference]: Without dead ends: 40 [2018-12-04 11:43:42,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:43:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-04 11:43:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-04 11:43:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-04 11:43:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-12-04 11:43:42,671 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2018-12-04 11:43:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:42,671 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-12-04 11:43:42,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-04 11:43:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-12-04 11:43:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-04 11:43:42,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:42,671 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2018-12-04 11:43:42,672 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:42,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2018-12-04 11:43:42,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:42,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:42,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:42,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:42,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:43,148 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:43,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:43,149 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:43,149 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:43,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:43,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:43,150 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-04 11:43:43,158 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:43,158 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:43,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-04 11:43:43,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:43,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:43,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:43,589 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:43,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:43,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2018-12-04 11:43:43,608 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:43,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-04 11:43:43,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-04 11:43:43,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2018-12-04 11:43:43,608 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2018-12-04 11:43:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:43,859 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-12-04 11:43:43,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-04 11:43:43,860 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-12-04 11:43:43,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:43,861 INFO L225 Difference]: With dead ends: 43 [2018-12-04 11:43:43,861 INFO L226 Difference]: Without dead ends: 41 [2018-12-04 11:43:43,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2018-12-04 11:43:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-04 11:43:43,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-04 11:43:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-04 11:43:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-04 11:43:43,879 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2018-12-04 11:43:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:43,879 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-04 11:43:43,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-04 11:43:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-04 11:43:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-04 11:43:43,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:43,880 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2018-12-04 11:43:43,880 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:43,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:43,880 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2018-12-04 11:43:43,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:43,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:43,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:43,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:43,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:45,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:45,155 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:45,155 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:45,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:45,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:45,155 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-04 11:43:45,172 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:45,172 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:45,195 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:45,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:45,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:46,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:46,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:46,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:46,068 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:43:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:43:46,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:46,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:46,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:46,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:46,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:43:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2018-12-04 11:43:47,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:47,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2018-12-04 11:43:47,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:47,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-04 11:43:47,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-04 11:43:47,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2018-12-04 11:43:47,363 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2018-12-04 11:43:50,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:50,074 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-04 11:43:50,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-04 11:43:50,075 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2018-12-04 11:43:50,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:50,075 INFO L225 Difference]: With dead ends: 65 [2018-12-04 11:43:50,076 INFO L226 Difference]: Without dead ends: 43 [2018-12-04 11:43:50,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1393, Invalid=8707, Unknown=0, NotChecked=0, Total=10100 [2018-12-04 11:43:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-04 11:43:50,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-04 11:43:50,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-04 11:43:50,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-04 11:43:50,100 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-04 11:43:50,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:50,100 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-04 11:43:50,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-04 11:43:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-04 11:43:50,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-04 11:43:50,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:50,101 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2018-12-04 11:43:50,101 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:50,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:50,102 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2018-12-04 11:43:50,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:50,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:50,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:50,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:50,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:51,104 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:51,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:51,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:51,105 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:51,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:51,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:51,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 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-04 11:43:51,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:51,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:43:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:51,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:52,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:52,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:52,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:52,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:43:52,214 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:52,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:52,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:52,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:52,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:52,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:43:52,564 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:52,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:52,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2018-12-04 11:43:52,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:52,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-04 11:43:52,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-04 11:43:52,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2018-12-04 11:43:52,585 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2018-12-04 11:43:55,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:55,125 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-12-04 11:43:55,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-04 11:43:55,125 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2018-12-04 11:43:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:55,126 INFO L225 Difference]: With dead ends: 66 [2018-12-04 11:43:55,126 INFO L226 Difference]: Without dead ends: 44 [2018-12-04 11:43:55,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:43:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-04 11:43:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-04 11:43:55,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-04 11:43:55,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-12-04 11:43:55,151 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2018-12-04 11:43:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:55,151 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-12-04 11:43:55,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-04 11:43:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-12-04 11:43:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-04 11:43:55,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:55,152 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2018-12-04 11:43:55,152 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:55,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2018-12-04 11:43:55,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:55,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:55,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:43:55,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:55,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:55,431 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:55,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:55,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:55,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:55,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:55,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:55,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 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-04 11:43:55,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:43:55,442 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:43:55,513 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-04 11:43:55,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:55,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:55,526 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:55,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:55,933 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:55,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:55,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2018-12-04 11:43:55,952 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:55,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-04 11:43:55,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-04 11:43:55,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2018-12-04 11:43:55,953 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2018-12-04 11:43:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:43:56,257 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-12-04 11:43:56,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-04 11:43:56,257 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-12-04 11:43:56,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:43:56,257 INFO L225 Difference]: With dead ends: 47 [2018-12-04 11:43:56,257 INFO L226 Difference]: Without dead ends: 45 [2018-12-04 11:43:56,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2018-12-04 11:43:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-04 11:43:56,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-04 11:43:56,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-04 11:43:56,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-04 11:43:56,275 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2018-12-04 11:43:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:43:56,275 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-04 11:43:56,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-04 11:43:56,275 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-04 11:43:56,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-04 11:43:56,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:43:56,275 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2018-12-04 11:43:56,276 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:43:56,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:43:56,276 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2018-12-04 11:43:56,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:43:56,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:56,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:43:56,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:43:56,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:43:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:43:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:43:57,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:57,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:43:57,320 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:43:57,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:43:57,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:43:57,320 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-04 11:43:57,328 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:43:57,329 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:43:57,358 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:43:57,358 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:43:57,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:43:58,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:43:58,475 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:58,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:58,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:43:58,543 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:43:58,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:43:58,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:43:58,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:43:58,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:43:58,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:43:59,912 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-12-04 11:43:59,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:43:59,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2018-12-04 11:43:59,931 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:43:59,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-04 11:43:59,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-04 11:43:59,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2018-12-04 11:43:59,932 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2018-12-04 11:44:03,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:03,308 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2018-12-04 11:44:03,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-04 11:44:03,309 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2018-12-04 11:44:03,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:03,309 INFO L225 Difference]: With dead ends: 71 [2018-12-04 11:44:03,310 INFO L226 Difference]: Without dead ends: 47 [2018-12-04 11:44:03,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1663, Invalid=10547, Unknown=0, NotChecked=0, Total=12210 [2018-12-04 11:44:03,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-04 11:44:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-04 11:44:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-04 11:44:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-12-04 11:44:03,330 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-12-04 11:44:03,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:03,330 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-12-04 11:44:03,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-04 11:44:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-12-04 11:44:03,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-04 11:44:03,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:03,331 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2018-12-04 11:44:03,331 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:03,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:03,331 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2018-12-04 11:44:03,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:03,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:03,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:03,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:03,332 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:04,448 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:04,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:04,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:04,449 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:04,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:04,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:04,449 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-04 11:44:04,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:04,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:04,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:05,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:44:05,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:05,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:05,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:44:05,738 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:05,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:05,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:44:05,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:05,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:05,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:44:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:06,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:06,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2018-12-04 11:44:06,219 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:06,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-04 11:44:06,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-04 11:44:06,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2018-12-04 11:44:06,220 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states. [2018-12-04 11:44:09,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:09,380 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-12-04 11:44:09,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-04 11:44:09,381 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2018-12-04 11:44:09,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:09,381 INFO L225 Difference]: With dead ends: 72 [2018-12-04 11:44:09,382 INFO L226 Difference]: Without dead ends: 48 [2018-12-04 11:44:09,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:44:09,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-04 11:44:09,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-04 11:44:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-04 11:44:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-12-04 11:44:09,402 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2018-12-04 11:44:09,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:09,402 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-12-04 11:44:09,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-04 11:44:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-12-04 11:44:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-04 11:44:09,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:09,402 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2018-12-04 11:44:09,403 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:09,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:09,403 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 32 times [2018-12-04 11:44:09,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:09,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:09,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:09,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:09,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:09,897 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:09,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:09,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:09,898 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:09,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:09,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:09,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 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-04 11:44:09,907 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:09,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:09,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-04 11:44:09,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:09,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:09,999 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:10,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:10,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:10,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2018-12-04 11:44:10,411 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:10,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-04 11:44:10,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-04 11:44:10,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2018-12-04 11:44:10,412 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2018-12-04 11:44:10,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:10,770 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-04 11:44:10,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-04 11:44:10,770 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-12-04 11:44:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:10,771 INFO L225 Difference]: With dead ends: 51 [2018-12-04 11:44:10,771 INFO L226 Difference]: Without dead ends: 49 [2018-12-04 11:44:10,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 44 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2018-12-04 11:44:10,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-04 11:44:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-04 11:44:10,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-04 11:44:10,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-04 11:44:10,792 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2018-12-04 11:44:10,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:10,792 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-04 11:44:10,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-04 11:44:10,792 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-04 11:44:10,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-04 11:44:10,793 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:10,793 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2018-12-04 11:44:10,793 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:10,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:10,793 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 33 times [2018-12-04 11:44:10,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:10,794 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:10,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:10,794 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:12,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:12,129 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:12,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:12,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:12,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:12,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:44:12,140 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:12,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:12,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:12,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:12,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:13,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:44:13,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:13,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:13,540 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:44:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:44:13,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:13,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:44:13,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:13,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:13,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:44:15,366 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-12-04 11:44:15,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:15,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25, 25] total 94 [2018-12-04 11:44:15,385 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:15,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-04 11:44:15,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-04 11:44:15,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=7544, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:44:15,387 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 71 states. [2018-12-04 11:44:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:19,252 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-12-04 11:44:19,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-04 11:44:19,252 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 48 [2018-12-04 11:44:19,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:19,253 INFO L225 Difference]: With dead ends: 77 [2018-12-04 11:44:19,253 INFO L226 Difference]: Without dead ends: 51 [2018-12-04 11:44:19,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1957, Invalid=12563, Unknown=0, NotChecked=0, Total=14520 [2018-12-04 11:44:19,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-04 11:44:19,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-04 11:44:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-04 11:44:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-04 11:44:19,276 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-04 11:44:19,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:19,276 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-04 11:44:19,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-04 11:44:19,276 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-04 11:44:19,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-04 11:44:19,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:19,277 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2018-12-04 11:44:19,277 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:19,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:19,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 34 times [2018-12-04 11:44:19,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:19,278 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:19,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:19,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:20,683 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:20,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:20,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:20,684 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:20,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:20,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:20,684 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-04 11:44:20,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:20,693 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:20,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:20,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:22,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:44:22,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:22,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:22,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:44:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:22,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:22,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:44:22,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:22,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:22,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:44:22,666 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:22,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:22,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2018-12-04 11:44:22,684 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:22,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-04 11:44:22,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-04 11:44:22,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5477, Unknown=0, NotChecked=0, Total=5700 [2018-12-04 11:44:22,685 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2018-12-04 11:44:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:25,818 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-12-04 11:44:25,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-04 11:44:25,818 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 50 [2018-12-04 11:44:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:25,819 INFO L225 Difference]: With dead ends: 78 [2018-12-04 11:44:25,819 INFO L226 Difference]: Without dead ends: 52 [2018-12-04 11:44:25,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=472, Invalid=9830, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:44:25,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-04 11:44:25,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-04 11:44:25,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-04 11:44:25,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-12-04 11:44:25,846 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2018-12-04 11:44:25,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:25,846 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-12-04 11:44:25,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-04 11:44:25,846 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-12-04 11:44:25,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-04 11:44:25,846 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:25,846 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2018-12-04 11:44:25,846 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:25,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:25,847 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 35 times [2018-12-04 11:44:25,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:25,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:25,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:25,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:25,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:26,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:26,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:26,195 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:26,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:26,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:26,196 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-04 11:44:26,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:26,204 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:26,302 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-04 11:44:26,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:26,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:26,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:26,800 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:26,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:26,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2018-12-04 11:44:26,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:26,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-04 11:44:26,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-04 11:44:26,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2018-12-04 11:44:26,819 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2018-12-04 11:44:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:27,214 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-12-04 11:44:27,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-04 11:44:27,214 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-12-04 11:44:27,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:27,215 INFO L225 Difference]: With dead ends: 55 [2018-12-04 11:44:27,216 INFO L226 Difference]: Without dead ends: 53 [2018-12-04 11:44:27,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 48 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2018-12-04 11:44:27,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-04 11:44:27,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-04 11:44:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-04 11:44:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-04 11:44:27,240 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2018-12-04 11:44:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:27,240 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-04 11:44:27,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-04 11:44:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-04 11:44:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-04 11:44:27,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:27,241 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2018-12-04 11:44:27,241 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:27,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:27,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 36 times [2018-12-04 11:44:27,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:27,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:27,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:27,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:27,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:28,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:28,651 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:28,651 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:28,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:28,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:28,651 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-04 11:44:28,659 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:28,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:28,691 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:28,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:28,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:30,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:44:30,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:30,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:30,199 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:44:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:44:30,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:30,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:44:30,351 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:30,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:30,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:44:32,756 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2018-12-04 11:44:32,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:32,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 102 [2018-12-04 11:44:32,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:32,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-04 11:44:32,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-04 11:44:32,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=8900, Unknown=0, NotChecked=0, Total=10302 [2018-12-04 11:44:32,777 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 77 states. [2018-12-04 11:44:36,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:36,904 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-12-04 11:44:36,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-04 11:44:36,905 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 52 [2018-12-04 11:44:36,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:36,906 INFO L225 Difference]: With dead ends: 83 [2018-12-04 11:44:36,906 INFO L226 Difference]: Without dead ends: 55 [2018-12-04 11:44:36,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=2275, Invalid=14755, Unknown=0, NotChecked=0, Total=17030 [2018-12-04 11:44:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-04 11:44:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-04 11:44:36,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-04 11:44:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-12-04 11:44:36,936 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-12-04 11:44:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:36,936 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-12-04 11:44:36,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-04 11:44:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-12-04 11:44:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-04 11:44:36,937 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:36,937 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2018-12-04 11:44:36,937 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:36,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:36,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 37 times [2018-12-04 11:44:36,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:36,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:36,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:36,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:36,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:38,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:38,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:38,412 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:38,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:38,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:38,413 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-04 11:44:38,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:38,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:38,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:40,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:44:40,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:40,252 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:40,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:44:40,324 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:40,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:40,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:44:40,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:40,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:40,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:44:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:40,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:40,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2018-12-04 11:44:40,951 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:40,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-04 11:44:40,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-04 11:44:40,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2018-12-04 11:44:40,952 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 82 states. [2018-12-04 11:44:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:44,791 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-12-04 11:44:44,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-04 11:44:44,791 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 54 [2018-12-04 11:44:44,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:44,792 INFO L225 Difference]: With dead ends: 84 [2018-12-04 11:44:44,792 INFO L226 Difference]: Without dead ends: 56 [2018-12-04 11:44:44,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2018-12-04 11:44:44,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-04 11:44:44,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-04 11:44:44,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-04 11:44:44,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-12-04 11:44:44,820 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2018-12-04 11:44:44,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:44,820 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-12-04 11:44:44,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-04 11:44:44,820 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-12-04 11:44:44,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-04 11:44:44,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:44,821 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2018-12-04 11:44:44,821 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:44,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:44,821 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 38 times [2018-12-04 11:44:44,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:44,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:44,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:44,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:44,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:45,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:45,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:45,217 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:45,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:45,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:45,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 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-04 11:44:45,226 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:44:45,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:44:45,339 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-04 11:44:45,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:45,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:45,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:45,973 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:45,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:45,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2018-12-04 11:44:45,992 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:45,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-04 11:44:45,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-04 11:44:45,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2018-12-04 11:44:45,993 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2018-12-04 11:44:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:46,453 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-12-04 11:44:46,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-04 11:44:46,454 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-12-04 11:44:46,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:46,454 INFO L225 Difference]: With dead ends: 59 [2018-12-04 11:44:46,454 INFO L226 Difference]: Without dead ends: 57 [2018-12-04 11:44:46,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 83 SyntacticMatches, 52 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2018-12-04 11:44:46,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-04 11:44:46,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-04 11:44:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-04 11:44:46,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-04 11:44:46,483 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2018-12-04 11:44:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:46,483 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-04 11:44:46,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-04 11:44:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-04 11:44:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-04 11:44:46,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:46,484 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2018-12-04 11:44:46,484 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:46,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:46,484 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 39 times [2018-12-04 11:44:46,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:46,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:46,485 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:46,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:46,485 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:48,440 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:48,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:48,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:48,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:48,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:48,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:48,441 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-04 11:44:48,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:44:48,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:44:48,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:44:48,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:44:48,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:44:50,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:44:50,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:50,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:50,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:44:50,241 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:44:50,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:44:50,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:44:50,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:44:50,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:44:50,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:44:52,303 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2018-12-04 11:44:52,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:44:52,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 29, 29] total 110 [2018-12-04 11:44:52,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:44:52,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-04 11:44:52,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-04 11:44:52,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=10368, Unknown=0, NotChecked=0, Total=11990 [2018-12-04 11:44:52,323 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 83 states. [2018-12-04 11:44:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:44:57,175 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-12-04 11:44:57,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-04 11:44:57,176 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 56 [2018-12-04 11:44:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:44:57,177 INFO L225 Difference]: With dead ends: 89 [2018-12-04 11:44:57,177 INFO L226 Difference]: Without dead ends: 59 [2018-12-04 11:44:57,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2617, Invalid=17123, Unknown=0, NotChecked=0, Total=19740 [2018-12-04 11:44:57,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-04 11:44:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-04 11:44:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-04 11:44:57,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-04 11:44:57,206 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-04 11:44:57,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:44:57,206 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-04 11:44:57,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-04 11:44:57,206 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-04 11:44:57,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-04 11:44:57,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:44:57,207 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2018-12-04 11:44:57,207 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:44:57,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:44:57,207 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 40 times [2018-12-04 11:44:57,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:44:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:57,208 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:44:57,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:44:57,208 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:44:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:44:59,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:59,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:44:59,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:44:59,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:44:59,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:44:59,207 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-04 11:44:59,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:44:59,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:44:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:44:59,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:01,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:45:01,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:45:01,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:45:01,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:45:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:01,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:01,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:45:01,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:45:01,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:45:01,217 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:45:01,926 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:01,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:01,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2018-12-04 11:45:01,944 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:01,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-04 11:45:01,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-04 11:45:01,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=7397, Unknown=0, NotChecked=0, Total=7656 [2018-12-04 11:45:01,945 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 88 states. [2018-12-04 11:45:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:06,258 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-12-04 11:45:06,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-04 11:45:06,258 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 58 [2018-12-04 11:45:06,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:06,259 INFO L225 Difference]: With dead ends: 90 [2018-12-04 11:45:06,259 INFO L226 Difference]: Without dead ends: 60 [2018-12-04 11:45:06,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=548, Invalid=13258, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:45:06,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-04 11:45:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-04 11:45:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-04 11:45:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-12-04 11:45:06,287 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2018-12-04 11:45:06,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:06,287 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-12-04 11:45:06,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-04 11:45:06,287 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-12-04 11:45:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-04 11:45:06,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:06,288 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2018-12-04 11:45:06,288 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:06,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:06,288 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 41 times [2018-12-04 11:45:06,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:06,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:06,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:06,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:06,985 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:06,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:06,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:06,986 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:06,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:06,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:06,986 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-04 11:45:06,994 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:45:06,994 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:45:07,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-04 11:45:07,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:07,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:07,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:07,801 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:07,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:07,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2018-12-04 11:45:07,820 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:07,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-04 11:45:07,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-04 11:45:07,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2018-12-04 11:45:07,821 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2018-12-04 11:45:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:08,321 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-12-04 11:45:08,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-04 11:45:08,322 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-12-04 11:45:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:08,323 INFO L225 Difference]: With dead ends: 63 [2018-12-04 11:45:08,323 INFO L226 Difference]: Without dead ends: 61 [2018-12-04 11:45:08,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 56 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2018-12-04 11:45:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-04 11:45:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-04 11:45:08,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-04 11:45:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-04 11:45:08,357 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2018-12-04 11:45:08,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:08,357 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-04 11:45:08,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-04 11:45:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-04 11:45:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-04 11:45:08,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:08,357 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2018-12-04 11:45:08,358 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:08,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:08,358 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 42 times [2018-12-04 11:45:08,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:08,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:08,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:08,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:10,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:10,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:10,654 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:10,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:10,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:10,654 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-04 11:45:10,663 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:45:10,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:45:10,700 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:45:10,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:10,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:12,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:45:12,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:45:12,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:45:12,598 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:45:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:45:12,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:12,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:45:12,775 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:45:12,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:45:12,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:45:15,074 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2018-12-04 11:45:15,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:15,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 31, 31] total 118 [2018-12-04 11:45:15,094 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:15,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-04 11:45:15,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-04 11:45:15,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=11948, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:45:15,095 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 89 states. [2018-12-04 11:45:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:20,409 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2018-12-04 11:45:20,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-04 11:45:20,409 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 60 [2018-12-04 11:45:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:20,410 INFO L225 Difference]: With dead ends: 95 [2018-12-04 11:45:20,410 INFO L226 Difference]: Without dead ends: 63 [2018-12-04 11:45:20,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=2983, Invalid=19667, Unknown=0, NotChecked=0, Total=22650 [2018-12-04 11:45:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-04 11:45:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-04 11:45:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-04 11:45:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-04 11:45:20,446 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-12-04 11:45:20,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:20,446 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-04 11:45:20,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-04 11:45:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-04 11:45:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-04 11:45:20,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:20,447 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2018-12-04 11:45:20,447 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:20,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:20,448 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 43 times [2018-12-04 11:45:20,448 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:20,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:20,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:20,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:20,449 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:20,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:22,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:22,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:22,461 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:22,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:22,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:22,462 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-04 11:45:22,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:22,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:45:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:22,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:24,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:45:24,571 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:45:24,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:45:24,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:45:24,679 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:24,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:24,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:45:24,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:45:24,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:45:24,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:45:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:25,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:25,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2018-12-04 11:45:25,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:25,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-04 11:45:25,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-04 11:45:25,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=8465, Unknown=0, NotChecked=0, Total=8742 [2018-12-04 11:45:25,602 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 94 states. [2018-12-04 11:45:30,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:30,492 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-12-04 11:45:30,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-04 11:45:30,493 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 62 [2018-12-04 11:45:30,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:30,494 INFO L225 Difference]: With dead ends: 96 [2018-12-04 11:45:30,494 INFO L226 Difference]: Without dead ends: 64 [2018-12-04 11:45:30,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=586, Invalid=15164, Unknown=0, NotChecked=0, Total=15750 [2018-12-04 11:45:30,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-04 11:45:30,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-04 11:45:30,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-04 11:45:30,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-12-04 11:45:30,539 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2018-12-04 11:45:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:30,539 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-12-04 11:45:30,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-04 11:45:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-12-04 11:45:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-04 11:45:30,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:30,540 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2018-12-04 11:45:30,540 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:30,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:30,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 44 times [2018-12-04 11:45:30,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:30,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:30,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:30,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:30,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:30,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:31,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:31,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:31,019 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:31,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:31,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:31,019 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-04 11:45:31,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:45:31,028 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:45:31,185 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-04 11:45:31,186 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:31,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:31,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:32,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:32,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2018-12-04 11:45:32,039 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:32,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-04 11:45:32,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-04 11:45:32,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2018-12-04 11:45:32,040 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2018-12-04 11:45:32,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:32,552 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-12-04 11:45:32,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-04 11:45:32,552 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2018-12-04 11:45:32,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:32,553 INFO L225 Difference]: With dead ends: 67 [2018-12-04 11:45:32,553 INFO L226 Difference]: Without dead ends: 65 [2018-12-04 11:45:32,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 95 SyntacticMatches, 60 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2018-12-04 11:45:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-04 11:45:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-04 11:45:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-04 11:45:32,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-04 11:45:32,588 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2018-12-04 11:45:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:32,589 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-04 11:45:32,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-04 11:45:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-04 11:45:32,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-04 11:45:32,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:32,589 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2018-12-04 11:45:32,590 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:32,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:32,590 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 45 times [2018-12-04 11:45:32,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:32,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:32,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:32,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:32,591 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:34,513 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:34,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:34,513 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:34,513 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:34,513 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:34,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:34,513 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-04 11:45:34,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:45:34,535 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:45:34,574 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:45:34,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:34,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:36,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:45:36,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:45:36,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:45:36,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:45:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:45:36,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:36,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:45:36,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:45:37,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:45:37,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:45:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-12-04 11:45:39,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:39,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33, 33] total 126 [2018-12-04 11:45:39,618 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:39,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-04 11:45:39,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-04 11:45:39,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=13640, Unknown=0, NotChecked=0, Total=15750 [2018-12-04 11:45:39,620 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 95 states. [2018-12-04 11:45:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:45,556 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-12-04 11:45:45,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-04 11:45:45,557 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 64 [2018-12-04 11:45:45,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:45,558 INFO L225 Difference]: With dead ends: 101 [2018-12-04 11:45:45,558 INFO L226 Difference]: Without dead ends: 67 [2018-12-04 11:45:45,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=3373, Invalid=22387, Unknown=0, NotChecked=0, Total=25760 [2018-12-04 11:45:45,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-04 11:45:45,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-04 11:45:45,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-04 11:45:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-04 11:45:45,597 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-04 11:45:45,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:45,597 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-04 11:45:45,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-04 11:45:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-04 11:45:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-04 11:45:45,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:45,598 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2018-12-04 11:45:45,598 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:45,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:45,598 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 46 times [2018-12-04 11:45:45,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:45,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:45,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:45,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:47,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:47,964 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:47,964 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:47,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:47,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:47,965 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-04 11:45:47,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:47,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:45:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:48,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:50,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:45:50,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:45:50,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:45:50,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:45:50,413 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:50,413 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:50,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:45:50,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:45:50,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:45:50,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:45:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:51,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:51,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2018-12-04 11:45:51,429 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:51,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-04 11:45:51,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-04 11:45:51,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2018-12-04 11:45:51,430 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 100 states. [2018-12-04 11:45:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:56,070 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-12-04 11:45:56,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-04 11:45:56,071 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 66 [2018-12-04 11:45:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:56,072 INFO L225 Difference]: With dead ends: 102 [2018-12-04 11:45:56,072 INFO L226 Difference]: Without dead ends: 68 [2018-12-04 11:45:56,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2018-12-04 11:45:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-04 11:45:56,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-04 11:45:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-04 11:45:56,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-12-04 11:45:56,112 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2018-12-04 11:45:56,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:56,112 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-12-04 11:45:56,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-04 11:45:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-12-04 11:45:56,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-04 11:45:56,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:56,113 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2018-12-04 11:45:56,113 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:56,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 47 times [2018-12-04 11:45:56,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:56,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:45:56,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:56,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:45:57,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:57,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:57,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:45:57,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:45:57,177 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:45:57,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:45:57,177 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-04 11:45:57,185 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:45:57,186 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:45:57,357 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-04 11:45:57,357 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:45:57,362 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:45:57,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:57,378 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:45:58,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:45:58,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:45:58,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2018-12-04 11:45:58,418 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:45:58,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-04 11:45:58,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-04 11:45:58,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2018-12-04 11:45:58,419 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2018-12-04 11:45:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:45:59,019 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-12-04 11:45:59,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-04 11:45:59,020 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2018-12-04 11:45:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:45:59,020 INFO L225 Difference]: With dead ends: 71 [2018-12-04 11:45:59,020 INFO L226 Difference]: Without dead ends: 69 [2018-12-04 11:45:59,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 64 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2018-12-04 11:45:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-04 11:45:59,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-04 11:45:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-04 11:45:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-04 11:45:59,061 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2018-12-04 11:45:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:45:59,061 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-04 11:45:59,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-04 11:45:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-04 11:45:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-04 11:45:59,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:45:59,062 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2018-12-04 11:45:59,062 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:45:59,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:45:59,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 48 times [2018-12-04 11:45:59,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:45:59,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:59,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:45:59,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:45:59,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:45:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:01,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:01,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:01,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:01,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:01,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:01,532 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-04 11:46:01,540 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:46:01,540 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:46:01,583 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:46:01,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:01,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:04,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:46:04,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:46:04,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:46:04,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:46:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:46:04,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:04,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:46:04,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:46:04,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:46:04,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:46:07,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2018-12-04 11:46:07,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:07,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 35, 35] total 134 [2018-12-04 11:46:07,225 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:07,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-04 11:46:07,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-04 11:46:07,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2378, Invalid=15444, Unknown=0, NotChecked=0, Total=17822 [2018-12-04 11:46:07,227 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 101 states. [2018-12-04 11:46:14,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:14,533 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-12-04 11:46:14,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-04 11:46:14,534 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 68 [2018-12-04 11:46:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:14,535 INFO L225 Difference]: With dead ends: 107 [2018-12-04 11:46:14,535 INFO L226 Difference]: Without dead ends: 71 [2018-12-04 11:46:14,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=3787, Invalid=25283, Unknown=0, NotChecked=0, Total=29070 [2018-12-04 11:46:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-04 11:46:14,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-04 11:46:14,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-04 11:46:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-12-04 11:46:14,585 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2018-12-04 11:46:14,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:14,585 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-12-04 11:46:14,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-04 11:46:14,585 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-12-04 11:46:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-04 11:46:14,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:14,586 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2018-12-04 11:46:14,586 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:14,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:14,586 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 49 times [2018-12-04 11:46:14,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:14,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:14,587 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:14,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:14,587 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:17,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:17,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:17,487 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:17,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:17,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:17,488 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-04 11:46:17,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:17,497 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:46:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:17,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:20,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:46:20,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:46:20,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:46:20,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:46:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:20,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:20,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:46:20,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:46:20,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:46:20,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:46:21,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:21,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:21,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2018-12-04 11:46:21,417 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:21,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-04 11:46:21,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-04 11:46:21,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2018-12-04 11:46:21,418 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 106 states. [2018-12-04 11:46:27,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:27,388 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-12-04 11:46:27,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-04 11:46:27,388 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 70 [2018-12-04 11:46:27,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:27,389 INFO L225 Difference]: With dead ends: 108 [2018-12-04 11:46:27,389 INFO L226 Difference]: Without dead ends: 72 [2018-12-04 11:46:27,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 78 SyntacticMatches, 25 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 11:46:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-04 11:46:27,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-04 11:46:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-04 11:46:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-12-04 11:46:27,433 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2018-12-04 11:46:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:27,433 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-12-04 11:46:27,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-04 11:46:27,433 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-12-04 11:46:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-04 11:46:27,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:27,434 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2018-12-04 11:46:27,434 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:27,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:27,435 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 50 times [2018-12-04 11:46:27,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:27,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:27,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:27,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:27,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:29,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:29,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:29,629 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:29,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:29,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:29,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:46:29,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:46:29,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:46:29,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-04 11:46:29,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:29,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:29,863 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:30,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:30,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:30,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2018-12-04 11:46:30,771 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:30,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-04 11:46:30,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-04 11:46:30,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2018-12-04 11:46:30,772 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2018-12-04 11:46:31,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:31,416 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2018-12-04 11:46:31,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-04 11:46:31,416 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2018-12-04 11:46:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:31,417 INFO L225 Difference]: With dead ends: 75 [2018-12-04 11:46:31,417 INFO L226 Difference]: Without dead ends: 73 [2018-12-04 11:46:31,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 107 SyntacticMatches, 68 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2018-12-04 11:46:31,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-04 11:46:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-04 11:46:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-04 11:46:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-04 11:46:31,462 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2018-12-04 11:46:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:31,463 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-04 11:46:31,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-04 11:46:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-04 11:46:31,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-04 11:46:31,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:31,463 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2018-12-04 11:46:31,463 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:31,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:31,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 51 times [2018-12-04 11:46:31,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:31,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:31,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:31,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:31,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:34,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:34,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:34,025 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:34,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:34,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:34,025 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-04 11:46:34,046 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:46:34,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:46:34,095 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:46:34,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:46:34,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:36,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:46:36,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:46:36,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:46:36,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:46:36,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:46:36,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:37,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:46:37,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:46:37,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:46:37,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:46:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2018-12-04 11:46:40,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:40,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 37, 37] total 142 [2018-12-04 11:46:40,452 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:40,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-04 11:46:40,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-04 11:46:40,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=17360, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 11:46:40,453 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 107 states. [2018-12-04 11:46:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:46:47,911 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-12-04 11:46:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-04 11:46:47,912 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 72 [2018-12-04 11:46:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:46:47,913 INFO L225 Difference]: With dead ends: 113 [2018-12-04 11:46:47,913 INFO L226 Difference]: Without dead ends: 75 [2018-12-04 11:46:47,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=4225, Invalid=28355, Unknown=0, NotChecked=0, Total=32580 [2018-12-04 11:46:47,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-04 11:46:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-04 11:46:47,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-04 11:46:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-04 11:46:47,959 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-04 11:46:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:46:47,959 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-04 11:46:47,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-04 11:46:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-04 11:46:47,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-04 11:46:47,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:46:47,960 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2018-12-04 11:46:47,960 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:46:47,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:46:47,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 52 times [2018-12-04 11:46:47,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:46:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:47,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:46:47,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:46:47,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:46:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:50,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:50,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:50,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:46:50,524 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:46:50,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:46:50,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:46:50,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 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-04 11:46:50,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:46:50,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:46:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:46:50,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:46:53,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:46:53,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:46:53,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:46:53,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:46:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:53,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:46:53,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:46:53,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:46:53,726 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:46:53,726 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:46:54,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:46:54,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:46:54,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2018-12-04 11:46:54,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:46:54,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-04 11:46:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-04 11:46:54,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=12101, Unknown=0, NotChecked=0, Total=12432 [2018-12-04 11:46:54,875 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 112 states. [2018-12-04 11:47:01,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:01,363 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2018-12-04 11:47:01,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-04 11:47:01,363 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 74 [2018-12-04 11:47:01,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:01,364 INFO L225 Difference]: With dead ends: 114 [2018-12-04 11:47:01,364 INFO L226 Difference]: Without dead ends: 76 [2018-12-04 11:47:01,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 83 SyntacticMatches, 26 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=700, Invalid=21650, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 11:47:01,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-04 11:47:01,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-04 11:47:01,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-04 11:47:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-12-04 11:47:01,413 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2018-12-04 11:47:01,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:01,414 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-12-04 11:47:01,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-04 11:47:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-12-04 11:47:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-04 11:47:01,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:01,414 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2018-12-04 11:47:01,415 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:01,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:01,415 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 53 times [2018-12-04 11:47:01,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:01,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:01,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:01,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:01,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:02,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:02,054 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:02,054 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:02,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:02,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:02,055 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-04 11:47:02,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:47:02,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:47:02,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-04 11:47:02,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:02,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:02,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:03,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:03,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:03,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2018-12-04 11:47:03,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:03,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-04 11:47:03,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-04 11:47:03,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2018-12-04 11:47:03,398 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2018-12-04 11:47:04,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:04,101 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-12-04 11:47:04,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-04 11:47:04,101 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2018-12-04 11:47:04,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:04,102 INFO L225 Difference]: With dead ends: 79 [2018-12-04 11:47:04,102 INFO L226 Difference]: Without dead ends: 77 [2018-12-04 11:47:04,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 113 SyntacticMatches, 72 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2018-12-04 11:47:04,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-04 11:47:04,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-04 11:47:04,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-04 11:47:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-04 11:47:04,166 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2018-12-04 11:47:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:04,166 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-04 11:47:04,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-04 11:47:04,166 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-04 11:47:04,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-04 11:47:04,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:04,167 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2018-12-04 11:47:04,167 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:04,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:04,167 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 54 times [2018-12-04 11:47:04,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:04,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:04,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:07,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:07,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:07,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:07,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:07,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:07,431 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-04 11:47:07,440 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:47:07,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:47:07,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:47:07,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:07,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:11,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:47:11,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:47:11,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:47:11,505 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:47:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:47:11,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:11,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:47:11,720 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:47:11,731 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:47:11,731 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:47:15,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2018-12-04 11:47:15,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:15,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 39, 39] total 150 [2018-12-04 11:47:15,424 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:15,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-04 11:47:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-04 11:47:15,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2962, Invalid=19388, Unknown=0, NotChecked=0, Total=22350 [2018-12-04 11:47:15,426 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 113 states. [2018-12-04 11:47:24,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:24,371 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2018-12-04 11:47:24,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-12-04 11:47:24,372 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 76 [2018-12-04 11:47:24,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:24,373 INFO L225 Difference]: With dead ends: 119 [2018-12-04 11:47:24,373 INFO L226 Difference]: Without dead ends: 79 [2018-12-04 11:47:24,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=4687, Invalid=31603, Unknown=0, NotChecked=0, Total=36290 [2018-12-04 11:47:24,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-04 11:47:24,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-04 11:47:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-04 11:47:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-12-04 11:47:24,443 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-12-04 11:47:24,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:24,443 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-12-04 11:47:24,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-04 11:47:24,444 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-12-04 11:47:24,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-04 11:47:24,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:24,444 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2018-12-04 11:47:24,444 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:24,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:24,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 55 times [2018-12-04 11:47:24,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:24,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:24,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:24,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:24,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:28,057 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:28,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:28,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:28,058 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:28,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:28,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:28,058 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-04 11:47:28,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:28,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:47:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:28,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:31,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:47:31,490 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:47:31,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:47:31,497 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:47:31,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:31,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:31,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:47:31,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:47:31,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:47:31,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:47:32,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:32,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:32,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2018-12-04 11:47:32,871 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:32,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-04 11:47:32,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-04 11:47:32,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=13457, Unknown=0, NotChecked=0, Total=13806 [2018-12-04 11:47:32,872 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 118 states. [2018-12-04 11:47:40,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:40,548 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2018-12-04 11:47:40,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-04 11:47:40,548 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 78 [2018-12-04 11:47:40,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:40,549 INFO L225 Difference]: With dead ends: 120 [2018-12-04 11:47:40,549 INFO L226 Difference]: Without dead ends: 80 [2018-12-04 11:47:40,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=738, Invalid=24068, Unknown=0, NotChecked=0, Total=24806 [2018-12-04 11:47:40,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-04 11:47:40,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-04 11:47:40,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-04 11:47:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-12-04 11:47:40,611 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2018-12-04 11:47:40,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:40,611 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-12-04 11:47:40,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-04 11:47:40,611 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-12-04 11:47:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-04 11:47:40,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:40,612 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2018-12-04 11:47:40,612 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:40,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:40,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 56 times [2018-12-04 11:47:40,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:40,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:40,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:47:40,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:40,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:42,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:42,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:42,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:42,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:42,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:42,033 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-04 11:47:42,061 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:47:42,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:47:42,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-04 11:47:42,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:42,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:42,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:43,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:43,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2018-12-04 11:47:43,596 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:43,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-04 11:47:43,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-04 11:47:43,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2018-12-04 11:47:43,597 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2018-12-04 11:47:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:47:44,384 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2018-12-04 11:47:44,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-04 11:47:44,384 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2018-12-04 11:47:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:47:44,385 INFO L225 Difference]: With dead ends: 83 [2018-12-04 11:47:44,385 INFO L226 Difference]: Without dead ends: 81 [2018-12-04 11:47:44,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 119 SyntacticMatches, 76 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2018-12-04 11:47:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-04 11:47:44,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-04 11:47:44,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-04 11:47:44,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-04 11:47:44,442 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2018-12-04 11:47:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:47:44,442 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-04 11:47:44,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-04 11:47:44,442 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-04 11:47:44,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-04 11:47:44,443 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:47:44,443 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2018-12-04 11:47:44,443 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:47:44,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:47:44,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 57 times [2018-12-04 11:47:44,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:47:44,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:44,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:47:44,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:47:44,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:47:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:47:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:47:48,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:48,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:47:48,010 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:47:48,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:47:48,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:47:48,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 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-04 11:47:48,018 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:47:48,019 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:47:48,067 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:47:48,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:47:48,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:47:52,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:47:52,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:47:52,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:47:52,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:47:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:47:52,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:47:52,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:47:52,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:47:52,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:47:52,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:47:57,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2018-12-04 11:47:57,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:47:57,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 41, 41] total 158 [2018-12-04 11:47:57,038 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:47:57,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-04 11:47:57,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-04 11:47:57,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=21528, Unknown=0, NotChecked=0, Total=24806 [2018-12-04 11:47:57,039 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 119 states. [2018-12-04 11:48:06,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:06,299 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2018-12-04 11:48:06,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-12-04 11:48:06,300 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 80 [2018-12-04 11:48:06,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:06,300 INFO L225 Difference]: With dead ends: 125 [2018-12-04 11:48:06,301 INFO L226 Difference]: Without dead ends: 83 [2018-12-04 11:48:06,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=5173, Invalid=35027, Unknown=0, NotChecked=0, Total=40200 [2018-12-04 11:48:06,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-04 11:48:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-04 11:48:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-04 11:48:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-04 11:48:06,384 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-04 11:48:06,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:06,385 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-04 11:48:06,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-04 11:48:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-04 11:48:06,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-04 11:48:06,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:06,385 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2018-12-04 11:48:06,385 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:06,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:06,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 58 times [2018-12-04 11:48:06,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:06,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:06,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:06,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:06,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:09,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:09,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:09,563 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:09,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:09,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:09,563 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-04 11:48:09,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:09,572 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:48:09,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:09,655 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:13,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:48:13,157 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:48:13,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:48:13,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:48:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:13,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:13,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:48:13,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:48:13,288 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:48:13,288 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:48:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:14,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:14,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2018-12-04 11:48:14,727 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:14,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-04 11:48:14,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-04 11:48:14,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2018-12-04 11:48:14,728 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 124 states. [2018-12-04 11:48:23,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:23,130 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2018-12-04 11:48:23,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-04 11:48:23,130 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 82 [2018-12-04 11:48:23,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:23,131 INFO L225 Difference]: With dead ends: 126 [2018-12-04 11:48:23,131 INFO L226 Difference]: Without dead ends: 84 [2018-12-04 11:48:23,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 93 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 11:48:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-04 11:48:23,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-04 11:48:23,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-04 11:48:23,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-12-04 11:48:23,186 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2018-12-04 11:48:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:23,186 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-12-04 11:48:23,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-04 11:48:23,187 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-12-04 11:48:23,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-04 11:48:23,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:23,187 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2018-12-04 11:48:23,187 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:23,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:23,188 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 59 times [2018-12-04 11:48:23,188 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:23,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:23,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:23,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:23,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:24,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:24,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:24,431 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:24,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:24,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:24,431 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-04 11:48:24,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:48:24,440 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:48:24,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-04 11:48:24,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:48:24,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:24,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:25,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:25,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:25,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2018-12-04 11:48:25,954 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:25,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-04 11:48:25,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-04 11:48:25,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2018-12-04 11:48:25,955 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2018-12-04 11:48:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:26,759 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2018-12-04 11:48:26,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-04 11:48:26,759 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2018-12-04 11:48:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:26,760 INFO L225 Difference]: With dead ends: 87 [2018-12-04 11:48:26,760 INFO L226 Difference]: Without dead ends: 85 [2018-12-04 11:48:26,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 125 SyntacticMatches, 80 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2018-12-04 11:48:26,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-04 11:48:26,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-04 11:48:26,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-04 11:48:26,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-04 11:48:26,833 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2018-12-04 11:48:26,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:26,833 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-04 11:48:26,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-04 11:48:26,833 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-04 11:48:26,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-04 11:48:26,834 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:26,834 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2018-12-04 11:48:26,834 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:26,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:26,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 60 times [2018-12-04 11:48:26,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:26,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:26,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:26,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:26,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:30,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:30,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:30,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:30,086 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:30,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:30,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:30,087 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-04 11:48:30,095 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:48:30,095 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:48:30,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:48:30,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:48:30,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:33,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:48:33,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:48:33,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:48:33,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:48:34,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:48:34,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:34,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:48:34,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:48:34,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:48:34,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:48:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-12-04 11:48:38,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:38,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 43, 43] total 166 [2018-12-04 11:48:38,800 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:38,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-12-04 11:48:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-12-04 11:48:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3610, Invalid=23780, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 11:48:38,802 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 125 states. [2018-12-04 11:48:49,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:48:49,291 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-12-04 11:48:49,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-12-04 11:48:49,292 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 84 [2018-12-04 11:48:49,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:48:49,293 INFO L225 Difference]: With dead ends: 131 [2018-12-04 11:48:49,293 INFO L226 Difference]: Without dead ends: 87 [2018-12-04 11:48:49,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=5683, Invalid=38627, Unknown=0, NotChecked=0, Total=44310 [2018-12-04 11:48:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-04 11:48:49,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-04 11:48:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-04 11:48:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-12-04 11:48:49,366 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2018-12-04 11:48:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:48:49,367 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-12-04 11:48:49,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-12-04 11:48:49,367 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-12-04 11:48:49,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-04 11:48:49,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:48:49,367 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2018-12-04 11:48:49,367 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:48:49,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:48:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 61 times [2018-12-04 11:48:49,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:48:49,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:49,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:48:49,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:48:49,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:48:49,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:53,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:53,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:48:53,197 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:48:53,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:48:53,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:48:53,197 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-04 11:48:53,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:48:53,206 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:48:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:48:53,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:48:57,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:48:57,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:48:57,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:48:57,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:48:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:57,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:48:57,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:48:57,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:48:57,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:48:57,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:48:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:48:58,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:48:58,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 129 [2018-12-04 11:48:58,871 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:48:58,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-04 11:48:58,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-04 11:48:58,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=16385, Unknown=0, NotChecked=0, Total=16770 [2018-12-04 11:48:58,875 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 130 states. [2018-12-04 11:49:07,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:07,910 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-04 11:49:07,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-04 11:49:07,910 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 86 [2018-12-04 11:49:07,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:07,911 INFO L225 Difference]: With dead ends: 132 [2018-12-04 11:49:07,911 INFO L226 Difference]: Without dead ends: 88 [2018-12-04 11:49:07,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 97 SyntacticMatches, 30 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=814, Invalid=29288, Unknown=0, NotChecked=0, Total=30102 [2018-12-04 11:49:07,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-04 11:49:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-04 11:49:07,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-04 11:49:07,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-12-04 11:49:07,979 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2018-12-04 11:49:07,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:07,979 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-12-04 11:49:07,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-04 11:49:07,980 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-12-04 11:49:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-04 11:49:07,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:07,980 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2018-12-04 11:49:07,980 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:07,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:07,981 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 62 times [2018-12-04 11:49:07,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:07,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:07,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:49:07,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:07,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:08,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:08,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:08,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:08,874 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:08,874 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:08,874 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:49:08,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:08,874 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-04 11:49:08,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:49:08,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:49:09,205 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-04 11:49:09,205 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:49:09,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:09,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:09,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:10,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:10,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:10,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2018-12-04 11:49:10,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:10,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-04 11:49:10,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-04 11:49:10,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2018-12-04 11:49:10,585 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2018-12-04 11:49:11,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:11,534 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-12-04 11:49:11,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-04 11:49:11,535 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2018-12-04 11:49:11,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:11,535 INFO L225 Difference]: With dead ends: 91 [2018-12-04 11:49:11,535 INFO L226 Difference]: Without dead ends: 89 [2018-12-04 11:49:11,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 131 SyntacticMatches, 84 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2018-12-04 11:49:11,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-04 11:49:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-04 11:49:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-04 11:49:11,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-04 11:49:11,634 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2018-12-04 11:49:11,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:11,634 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-04 11:49:11,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-04 11:49:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-04 11:49:11,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-04 11:49:11,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:11,635 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2018-12-04 11:49:11,636 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:11,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:11,636 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 63 times [2018-12-04 11:49:11,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:11,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:11,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:49:11,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:11,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:15,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:15,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:15,745 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:15,745 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:15,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:49:15,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:15,745 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-04 11:49:15,756 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:49:15,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:49:15,808 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:49:15,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:49:15,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:20,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:49:20,123 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:49:20,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:49:20,129 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:49:20,258 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:49:20,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:20,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:49:20,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:49:20,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:49:20,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:49:25,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2018-12-04 11:49:25,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:25,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 45, 45] total 174 [2018-12-04 11:49:25,455 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:25,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-04 11:49:25,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-04 11:49:25,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=26144, Unknown=0, NotChecked=0, Total=30102 [2018-12-04 11:49:25,457 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 131 states. [2018-12-04 11:49:37,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:37,086 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-12-04 11:49:37,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-12-04 11:49:37,087 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 88 [2018-12-04 11:49:37,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:37,088 INFO L225 Difference]: With dead ends: 137 [2018-12-04 11:49:37,088 INFO L226 Difference]: Without dead ends: 91 [2018-12-04 11:49:37,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=6217, Invalid=42403, Unknown=0, NotChecked=0, Total=48620 [2018-12-04 11:49:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-04 11:49:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-04 11:49:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-04 11:49:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-04 11:49:37,158 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-04 11:49:37,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:37,158 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-04 11:49:37,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-04 11:49:37,158 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-04 11:49:37,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-04 11:49:37,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:37,159 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2018-12-04 11:49:37,159 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:37,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:37,159 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 64 times [2018-12-04 11:49:37,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:37,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:37,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:49:37,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:37,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:40,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:40,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:40,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:40,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:40,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:49:40,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:40,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 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-04 11:49:40,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:49:40,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:49:40,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:40,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:45,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:49:45,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:49:45,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:49:45,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:49:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:45,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:45,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:49:45,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:49:45,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:49:45,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:49:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:47,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:47,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 135 [2018-12-04 11:49:47,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:47,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-04 11:49:47,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-04 11:49:47,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=17957, Unknown=0, NotChecked=0, Total=18360 [2018-12-04 11:49:47,033 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 136 states. [2018-12-04 11:49:56,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:49:56,940 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2018-12-04 11:49:56,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-04 11:49:56,940 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 90 [2018-12-04 11:49:56,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:49:56,941 INFO L225 Difference]: With dead ends: 138 [2018-12-04 11:49:56,941 INFO L226 Difference]: Without dead ends: 92 [2018-12-04 11:49:56,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 102 SyntacticMatches, 31 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=852, Invalid=32090, Unknown=0, NotChecked=0, Total=32942 [2018-12-04 11:49:56,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-04 11:49:57,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-04 11:49:57,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-04 11:49:57,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2018-12-04 11:49:57,007 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2018-12-04 11:49:57,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:49:57,007 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2018-12-04 11:49:57,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-04 11:49:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2018-12-04 11:49:57,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-04 11:49:57,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:49:57,007 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2018-12-04 11:49:57,008 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:49:57,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:49:57,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 65 times [2018-12-04 11:49:57,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:49:57,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:57,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:49:57,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:49:57,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:49:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:49:57,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:57,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:57,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:49:57,861 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:49:57,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:49:57,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:49:57,861 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-04 11:49:57,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:49:57,870 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:49:58,221 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-04 11:49:58,221 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:49:58,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:49:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:58,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:49:59,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:49:59,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:49:59,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2018-12-04 11:49:59,713 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:49:59,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-04 11:49:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-04 11:49:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2018-12-04 11:49:59,714 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2018-12-04 11:50:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:00,695 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-12-04 11:50:00,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-04 11:50:00,695 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2018-12-04 11:50:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:00,696 INFO L225 Difference]: With dead ends: 95 [2018-12-04 11:50:00,696 INFO L226 Difference]: Without dead ends: 93 [2018-12-04 11:50:00,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 137 SyntacticMatches, 88 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2018-12-04 11:50:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-04 11:50:00,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-04 11:50:00,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-04 11:50:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-04 11:50:00,765 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2018-12-04 11:50:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:00,765 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-04 11:50:00,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-04 11:50:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-04 11:50:00,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-04 11:50:00,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:00,765 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2018-12-04 11:50:00,766 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:00,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 66 times [2018-12-04 11:50:00,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:00,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:00,767 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:50:00,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:00,767 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:00,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:04,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:04,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:04,687 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:04,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:50:04,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:04,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:50:04,695 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:50:04,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:50:04,748 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:50:04,748 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:50:04,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:09,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:50:09,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:50:09,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:50:09,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:50:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:50:09,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:09,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:50:09,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:50:09,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:50:09,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:50:15,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2018-12-04 11:50:15,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:15,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47, 47] total 182 [2018-12-04 11:50:15,123 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:15,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-12-04 11:50:15,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-12-04 11:50:15,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4322, Invalid=28620, Unknown=0, NotChecked=0, Total=32942 [2018-12-04 11:50:15,125 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 137 states. [2018-12-04 11:50:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:27,342 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2018-12-04 11:50:27,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-12-04 11:50:27,343 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 92 [2018-12-04 11:50:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:27,344 INFO L225 Difference]: With dead ends: 143 [2018-12-04 11:50:27,344 INFO L226 Difference]: Without dead ends: 95 [2018-12-04 11:50:27,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=6775, Invalid=46355, Unknown=0, NotChecked=0, Total=53130 [2018-12-04 11:50:27,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-04 11:50:27,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-04 11:50:27,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-04 11:50:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-12-04 11:50:27,438 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-12-04 11:50:27,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:27,438 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-12-04 11:50:27,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-12-04 11:50:27,438 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-12-04 11:50:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-04 11:50:27,439 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:27,439 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2018-12-04 11:50:27,439 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:27,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:27,439 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 67 times [2018-12-04 11:50:27,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:27,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:27,440 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:50:27,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:27,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:31,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:31,581 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:31,582 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:31,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:50:31,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:31,582 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-04 11:50:31,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:50:31,590 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:50:31,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:31,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:36,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:50:36,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:50:36,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:50:36,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:50:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:36,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:36,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:50:36,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:50:36,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:50:36,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:50:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:38,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:38,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 141 [2018-12-04 11:50:38,395 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:38,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-04 11:50:38,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-04 11:50:38,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=19601, Unknown=0, NotChecked=0, Total=20022 [2018-12-04 11:50:38,397 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 142 states. [2018-12-04 11:50:49,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:49,048 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2018-12-04 11:50:49,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-04 11:50:49,048 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 94 [2018-12-04 11:50:49,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:49,049 INFO L225 Difference]: With dead ends: 144 [2018-12-04 11:50:49,049 INFO L226 Difference]: Without dead ends: 96 [2018-12-04 11:50:49,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 106 SyntacticMatches, 33 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=890, Invalid=35020, Unknown=0, NotChecked=0, Total=35910 [2018-12-04 11:50:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-04 11:50:49,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-04 11:50:49,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-04 11:50:49,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-12-04 11:50:49,127 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2018-12-04 11:50:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:49,127 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-12-04 11:50:49,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-04 11:50:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-12-04 11:50:49,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-04 11:50:49,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:49,128 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2018-12-04 11:50:49,128 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:49,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:49,128 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 68 times [2018-12-04 11:50:49,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:49,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:49,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:50:49,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:49,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:50,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:50,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:50,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:50,043 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:50,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:50:50,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:50,043 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-04 11:50:50,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:50:50,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:50:50,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-04 11:50:50,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:50:50,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:50:50,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:50,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:50:52,125 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:52,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:50:52,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2018-12-04 11:50:52,146 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:50:52,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-04 11:50:52,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-04 11:50:52,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2018-12-04 11:50:52,147 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2018-12-04 11:50:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:50:53,212 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-12-04 11:50:53,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-04 11:50:53,213 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2018-12-04 11:50:53,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:50:53,213 INFO L225 Difference]: With dead ends: 99 [2018-12-04 11:50:53,213 INFO L226 Difference]: Without dead ends: 97 [2018-12-04 11:50:53,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 143 SyntacticMatches, 92 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2018-12-04 11:50:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-04 11:50:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-04 11:50:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-04 11:50:53,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-04 11:50:53,292 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2018-12-04 11:50:53,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:50:53,292 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-04 11:50:53,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-04 11:50:53,292 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-04 11:50:53,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-04 11:50:53,292 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:50:53,293 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2018-12-04 11:50:53,293 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:50:53,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:50:53,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 69 times [2018-12-04 11:50:53,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:50:53,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:53,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:50:53,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:50:53,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:50:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:50:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:50:57,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:57,479 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:50:57,480 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:50:57,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:50:57,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:50:57,480 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-04 11:50:57,488 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:50:57,488 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:50:57,546 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:50:57,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:50:57,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:02,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:51:02,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:51:02,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:51:02,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:51:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:51:02,776 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:02,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:51:02,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:51:02,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:51:02,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:51:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2018-12-04 11:51:08,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:08,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49, 49] total 190 [2018-12-04 11:51:08,910 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:08,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-12-04 11:51:08,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-12-04 11:51:08,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=31208, Unknown=0, NotChecked=0, Total=35910 [2018-12-04 11:51:08,912 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 143 states. [2018-12-04 11:51:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:23,138 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2018-12-04 11:51:23,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-12-04 11:51:23,138 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 96 [2018-12-04 11:51:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:23,139 INFO L225 Difference]: With dead ends: 149 [2018-12-04 11:51:23,139 INFO L226 Difference]: Without dead ends: 99 [2018-12-04 11:51:23,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=7357, Invalid=50483, Unknown=0, NotChecked=0, Total=57840 [2018-12-04 11:51:23,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-04 11:51:23,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-04 11:51:23,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-04 11:51:23,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-04 11:51:23,224 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-04 11:51:23,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:23,224 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-04 11:51:23,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-12-04 11:51:23,225 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-04 11:51:23,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-04 11:51:23,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:23,225 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2018-12-04 11:51:23,225 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:23,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 70 times [2018-12-04 11:51:23,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:23,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:23,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:51:23,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:23,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:27,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:27,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:27,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:27,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:27,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:51:27,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:27,665 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-04 11:51:27,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:51:27,675 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:51:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:27,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:32,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:51:32,817 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:51:32,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:51:32,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:51:32,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:32,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:32,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:51:32,975 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:51:32,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:51:32,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:51:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:35,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:35,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 147 [2018-12-04 11:51:35,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:35,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-04 11:51:35,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-04 11:51:35,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2018-12-04 11:51:35,110 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 148 states. [2018-12-04 11:51:45,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:45,480 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2018-12-04 11:51:45,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-04 11:51:45,480 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 98 [2018-12-04 11:51:45,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:45,481 INFO L225 Difference]: With dead ends: 150 [2018-12-04 11:51:45,481 INFO L226 Difference]: Without dead ends: 100 [2018-12-04 11:51:45,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 35 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6444 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2018-12-04 11:51:45,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-04 11:51:45,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-04 11:51:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-04 11:51:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2018-12-04 11:51:45,564 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2018-12-04 11:51:45,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:45,565 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2018-12-04 11:51:45,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-04 11:51:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2018-12-04 11:51:45,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-04 11:51:45,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:45,565 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2018-12-04 11:51:45,566 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:45,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:45,566 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 71 times [2018-12-04 11:51:45,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:45,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:45,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:51:45,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:45,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:45,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:46,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:46,542 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:46,542 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:46,542 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:51:46,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:46,542 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-04 11:51:46,550 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:51:46,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:51:47,019 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-04 11:51:47,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:51:47,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:51:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:47,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:51:48,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:48,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:51:48,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2018-12-04 11:51:48,751 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:51:48,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-04 11:51:48,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-04 11:51:48,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2018-12-04 11:51:48,752 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2018-12-04 11:51:49,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:51:49,923 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-12-04 11:51:49,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-04 11:51:49,924 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2018-12-04 11:51:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:51:49,924 INFO L225 Difference]: With dead ends: 103 [2018-12-04 11:51:49,924 INFO L226 Difference]: Without dead ends: 101 [2018-12-04 11:51:49,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 149 SyntacticMatches, 96 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2018-12-04 11:51:49,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-04 11:51:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-04 11:51:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-04 11:51:50,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-04 11:51:50,010 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2018-12-04 11:51:50,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:51:50,010 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-04 11:51:50,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-04 11:51:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-04 11:51:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-04 11:51:50,010 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:51:50,011 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2018-12-04 11:51:50,011 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:51:50,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:51:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 72 times [2018-12-04 11:51:50,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:51:50,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:50,012 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:51:50,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:51:50,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:51:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:51:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:51:54,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:54,525 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:51:54,525 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:51:54,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:51:54,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:51:54,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 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-04 11:51:54,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:51:54,533 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:51:54,591 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:51:54,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:51:54,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:52:00,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:52:00,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:52:00,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:52:00,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:52:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:52:00,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:52:00,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:52:00,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:52:00,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:52:00,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:52:06,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2018-12-04 11:52:07,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:52:07,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 51, 51] total 198 [2018-12-04 11:52:07,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:52:07,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-12-04 11:52:07,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-12-04 11:52:07,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5098, Invalid=33908, Unknown=0, NotChecked=0, Total=39006 [2018-12-04 11:52:07,015 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 149 states. [2018-12-04 11:52:21,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:52:21,697 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-12-04 11:52:21,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-12-04 11:52:21,698 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 100 [2018-12-04 11:52:21,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:52:21,699 INFO L225 Difference]: With dead ends: 155 [2018-12-04 11:52:21,699 INFO L226 Difference]: Without dead ends: 103 [2018-12-04 11:52:21,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=7963, Invalid=54787, Unknown=0, NotChecked=0, Total=62750 [2018-12-04 11:52:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-04 11:52:21,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-04 11:52:21,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-04 11:52:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-12-04 11:52:21,788 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2018-12-04 11:52:21,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:52:21,788 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-12-04 11:52:21,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-12-04 11:52:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-12-04 11:52:21,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-04 11:52:21,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:52:21,789 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2018-12-04 11:52:21,789 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:52:21,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:52:21,789 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 73 times [2018-12-04 11:52:21,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:52:21,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:21,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:52:21,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:21,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:52:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:26,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:26,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:52:26,485 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:52:26,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:52:26,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:26,485 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-04 11:52:26,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:52:26,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:52:26,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:26,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:52:32,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:52:32,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:52:32,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:52:32,211 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:52:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:32,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:52:32,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:52:32,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:52:32,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:52:32,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:52:34,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:34,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:52:34,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 153 [2018-12-04 11:52:34,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:52:34,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-04 11:52:34,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-04 11:52:34,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=23105, Unknown=0, NotChecked=0, Total=23562 [2018-12-04 11:52:34,698 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 154 states. [2018-12-04 11:52:46,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:52:46,060 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-12-04 11:52:46,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-04 11:52:46,060 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 102 [2018-12-04 11:52:46,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:52:46,061 INFO L225 Difference]: With dead ends: 156 [2018-12-04 11:52:46,061 INFO L226 Difference]: Without dead ends: 104 [2018-12-04 11:52:46,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 114 SyntacticMatches, 37 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7014 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=966, Invalid=41264, Unknown=0, NotChecked=0, Total=42230 [2018-12-04 11:52:46,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-04 11:52:46,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-04 11:52:46,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-04 11:52:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2018-12-04 11:52:46,152 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2018-12-04 11:52:46,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:52:46,152 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2018-12-04 11:52:46,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-04 11:52:46,152 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2018-12-04 11:52:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-04 11:52:46,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:52:46,152 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2018-12-04 11:52:46,153 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:52:46,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:52:46,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 74 times [2018-12-04 11:52:46,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:52:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:46,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:52:46,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:46,154 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:52:46,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:47,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:47,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:52:47,194 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:52:47,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:52:47,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:47,195 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-04 11:52:47,202 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:52:47,203 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:52:47,710 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-04 11:52:47,710 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:52:47,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:52:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:47,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:52:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:49,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:52:49,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2018-12-04 11:52:49,795 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:52:49,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-04 11:52:49,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-04 11:52:49,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2018-12-04 11:52:49,796 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2018-12-04 11:52:51,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:52:51,075 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2018-12-04 11:52:51,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-04 11:52:51,075 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2018-12-04 11:52:51,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:52:51,076 INFO L225 Difference]: With dead ends: 107 [2018-12-04 11:52:51,076 INFO L226 Difference]: Without dead ends: 105 [2018-12-04 11:52:51,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 155 SyntacticMatches, 100 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2018-12-04 11:52:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-04 11:52:51,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-04 11:52:51,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-04 11:52:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-04 11:52:51,171 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2018-12-04 11:52:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:52:51,172 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-04 11:52:51,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-04 11:52:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-04 11:52:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-04 11:52:51,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:52:51,172 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2018-12-04 11:52:51,173 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:52:51,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:52:51,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 75 times [2018-12-04 11:52:51,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:52:51,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:51,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:52:51,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:52:51,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:52:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:52:56,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:52:56,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:56,046 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:52:56,046 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:52:56,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:52:56,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:52:56,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 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-04 11:52:56,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:52:56,055 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:52:56,119 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:52:56,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:52:56,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:53:02,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:53:02,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:53:02,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:53:02,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:53:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:53:02,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:53:02,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:53:02,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:53:02,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:53:02,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:53:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2018-12-04 11:53:09,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:53:09,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53, 53] total 206 [2018-12-04 11:53:09,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:53:09,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-12-04 11:53:09,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-12-04 11:53:09,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=36720, Unknown=0, NotChecked=0, Total=42230 [2018-12-04 11:53:09,363 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 155 states. [2018-12-04 11:53:24,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:53:24,283 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-12-04 11:53:24,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-12-04 11:53:24,284 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 104 [2018-12-04 11:53:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:53:24,284 INFO L225 Difference]: With dead ends: 161 [2018-12-04 11:53:24,284 INFO L226 Difference]: Without dead ends: 107 [2018-12-04 11:53:24,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=8593, Invalid=59267, Unknown=0, NotChecked=0, Total=67860 [2018-12-04 11:53:24,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-04 11:53:24,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-04 11:53:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-04 11:53:24,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-04 11:53:24,380 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-04 11:53:24,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:53:24,380 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-04 11:53:24,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-12-04 11:53:24,381 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-04 11:53:24,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-04 11:53:24,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:53:24,381 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2018-12-04 11:53:24,381 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:53:24,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:53:24,382 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 76 times [2018-12-04 11:53:24,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:53:24,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:24,382 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:53:24,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:24,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:53:24,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:29,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:29,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:29,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:53:29,437 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:53:29,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:53:29,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:29,437 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-04 11:53:29,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:53:29,446 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:53:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:29,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:53:35,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:53:35,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:53:35,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:53:35,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:53:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:35,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:53:35,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:53:35,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:53:35,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:53:35,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:53:38,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:38,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:53:38,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 159 [2018-12-04 11:53:38,478 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:53:38,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-04 11:53:38,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-04 11:53:38,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=24965, Unknown=0, NotChecked=0, Total=25440 [2018-12-04 11:53:38,479 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 160 states. [2018-12-04 11:53:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:53:50,815 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2018-12-04 11:53:50,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-04 11:53:50,816 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 106 [2018-12-04 11:53:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:53:50,817 INFO L225 Difference]: With dead ends: 162 [2018-12-04 11:53:50,817 INFO L226 Difference]: Without dead ends: 108 [2018-12-04 11:53:50,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 118 SyntacticMatches, 39 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7608 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=1004, Invalid=44578, Unknown=0, NotChecked=0, Total=45582 [2018-12-04 11:53:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-04 11:53:50,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-04 11:53:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-04 11:53:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-12-04 11:53:50,916 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2018-12-04 11:53:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:53:50,916 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-12-04 11:53:50,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-04 11:53:50,916 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-12-04 11:53:50,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-04 11:53:50,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:53:50,917 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1] [2018-12-04 11:53:50,917 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:53:50,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:53:50,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107788, now seen corresponding path program 77 times [2018-12-04 11:53:50,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:53:50,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:50,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:53:50,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:50,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:53:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:53:52,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:52,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:52,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:53:52,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:53:52,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:53:52,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:53:52,208 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-04 11:53:52,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:53:52,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:53:52,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-04 11:53:52,783 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:53:52,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:53:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:52,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:53:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:53:54,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:53:54,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2018-12-04 11:53:54,895 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:53:54,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-04 11:53:54,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-04 11:53:54,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2018-12-04 11:53:54,896 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 55 states. [2018-12-04 11:53:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:53:56,091 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2018-12-04 11:53:56,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-04 11:53:56,091 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2018-12-04 11:53:56,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:53:56,091 INFO L225 Difference]: With dead ends: 111 [2018-12-04 11:53:56,092 INFO L226 Difference]: Without dead ends: 109 [2018-12-04 11:53:56,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 161 SyntacticMatches, 104 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2018-12-04 11:53:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-04 11:53:56,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-04 11:53:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-04 11:53:56,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-04 11:53:56,190 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2018-12-04 11:53:56,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:53:56,190 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-04 11:53:56,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-04 11:53:56,190 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-04 11:53:56,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-04 11:53:56,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:53:56,191 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2018-12-04 11:53:56,191 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:53:56,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:53:56,191 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 78 times [2018-12-04 11:53:56,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:53:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:56,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:53:56,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:53:56,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:53:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:54:01,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:01,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:01,744 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:54:01,745 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:54:01,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:54:01,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:01,745 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-04 11:54:01,753 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:54:01,754 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:54:01,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:54:01,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:54:01,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:54:08,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:54:08,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:54:08,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:54:08,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:54:08,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:54:08,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:54:08,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:54:08,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:54:08,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:54:08,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:54:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2018-12-04 11:54:16,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:54:16,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 55, 55] total 214 [2018-12-04 11:54:16,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:54:16,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-12-04 11:54:16,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-12-04 11:54:16,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5938, Invalid=39644, Unknown=0, NotChecked=0, Total=45582 [2018-12-04 11:54:16,609 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 161 states. [2018-12-04 11:54:33,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:54:33,669 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2018-12-04 11:54:33,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-12-04 11:54:33,669 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 108 [2018-12-04 11:54:33,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:54:33,670 INFO L225 Difference]: With dead ends: 167 [2018-12-04 11:54:33,670 INFO L226 Difference]: Without dead ends: 111 [2018-12-04 11:54:33,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=9247, Invalid=63923, Unknown=0, NotChecked=0, Total=73170 [2018-12-04 11:54:33,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-04 11:54:33,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-04 11:54:33,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-04 11:54:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-12-04 11:54:33,772 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-12-04 11:54:33,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:54:33,772 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-12-04 11:54:33,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-12-04 11:54:33,773 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-12-04 11:54:33,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-04 11:54:33,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:54:33,773 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2018-12-04 11:54:33,773 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:54:33,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:54:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 79 times [2018-12-04 11:54:33,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:54:33,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:33,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:54:33,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:54:33,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:54:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:54:39,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:39,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:39,269 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:54:39,269 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:54:39,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:54:39,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:54:39,269 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-04 11:54:39,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:54:39,278 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-04 11:54:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:54:39,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:54:45,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:54:45,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:54:45,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:54:45,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-12-04 11:54:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:45,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:54:45,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:54:45,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:54:45,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:54:45,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-12-04 11:54:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:54:48,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:54:48,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 165 [2018-12-04 11:54:48,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:54:48,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-04 11:54:48,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-04 11:54:48,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=26897, Unknown=0, NotChecked=0, Total=27390 [2018-12-04 11:54:48,510 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 166 states. [2018-12-04 11:55:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:55:01,663 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2018-12-04 11:55:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-04 11:55:01,663 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 110 [2018-12-04 11:55:01,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:55:01,664 INFO L225 Difference]: With dead ends: 168 [2018-12-04 11:55:01,664 INFO L226 Difference]: Without dead ends: 112 [2018-12-04 11:55:01,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 122 SyntacticMatches, 41 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8226 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=1042, Invalid=48020, Unknown=0, NotChecked=0, Total=49062 [2018-12-04 11:55:01,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-04 11:55:01,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-04 11:55:01,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-04 11:55:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2018-12-04 11:55:01,768 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2018-12-04 11:55:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:55:01,768 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2018-12-04 11:55:01,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-04 11:55:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2018-12-04 11:55:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-04 11:55:01,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:55:01,769 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1] [2018-12-04 11:55:01,769 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:55:01,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:55:01,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1280933780, now seen corresponding path program 80 times [2018-12-04 11:55:01,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:55:01,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:55:01,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-04 11:55:01,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:55:01,770 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:55:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:55:03,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:03,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:03,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:55:03,218 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:55:03,219 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:55:03,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:03,219 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-04 11:55:03,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-04 11:55:03,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-04 11:55:03,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-04 11:55:03,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:55:03,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:55:03,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:03,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:55:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:06,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:55:06,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2018-12-04 11:55:06,117 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:55:06,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-04 11:55:06,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-04 11:55:06,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2018-12-04 11:55:06,118 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 57 states. [2018-12-04 11:55:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-04 11:55:07,469 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-12-04 11:55:07,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-04 11:55:07,469 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2018-12-04 11:55:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-04 11:55:07,469 INFO L225 Difference]: With dead ends: 115 [2018-12-04 11:55:07,470 INFO L226 Difference]: Without dead ends: 113 [2018-12-04 11:55:07,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 167 SyntacticMatches, 108 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2018-12-04 11:55:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-04 11:55:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-04 11:55:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-04 11:55:07,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-12-04 11:55:07,576 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 111 [2018-12-04 11:55:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-04 11:55:07,576 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-12-04 11:55:07,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-04 11:55:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-12-04 11:55:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-04 11:55:07,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-04 11:55:07,577 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2018-12-04 11:55:07,577 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-04 11:55:07,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-04 11:55:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 81 times [2018-12-04 11:55:07,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-04 11:55:07,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:55:07,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-04 11:55:07,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-04 11:55:07,578 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-04 11:55:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-04 11:55:13,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-04 11:55:13,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:13,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-04 11:55:13,209 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-04 11:55:13,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-04 11:55:13,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-04 11:55:13,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-04 11:55:13,217 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-04 11:55:13,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-04 11:55:13,285 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-04 11:55:13,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-04 11:55:13,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-04 11:55:20,235 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-04 11:55:20,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:55:20,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:55:20,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-12-04 11:55:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-04 11:55:20,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-04 11:55:20,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-04 11:55:20,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-04 11:55:20,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-04 11:55:20,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2018-12-04 11:55:28,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2018-12-04 11:55:28,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-04 11:55:28,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 57, 57] total 222 [2018-12-04 11:55:28,809 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-04 11:55:28,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-12-04 11:55:28,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-12-04 11:55:28,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6382, Invalid=42680, Unknown=0, NotChecked=0, Total=49062 [2018-12-04 11:55:28,811 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 167 states.