java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 10:07:20,079 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 10:07:20,081 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 10:07:20,100 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 10:07:20,101 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 10:07:20,102 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 10:07:20,104 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 10:07:20,106 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 10:07:20,110 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 10:07:20,117 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 10:07:20,118 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 10:07:20,118 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 10:07:20,121 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 10:07:20,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 10:07:20,124 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 10:07:20,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 10:07:20,128 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 10:07:20,131 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 10:07:20,134 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 10:07:20,136 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 10:07:20,137 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 10:07:20,138 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 10:07:20,141 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 10:07:20,141 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 10:07:20,142 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 10:07:20,143 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 10:07:20,144 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 10:07:20,145 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 10:07:20,148 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 10:07:20,150 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 10:07:20,150 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 10:07:20,152 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 10:07:20,153 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 10:07:20,153 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 10:07:20,154 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 10:07:20,155 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 10:07:20,155 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-02-18 10:07:20,178 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 10:07:20,178 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 10:07:20,180 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 10:07:20,180 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 10:07:20,180 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 10:07:20,180 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 10:07:20,180 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 10:07:20,181 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 10:07:20,181 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 10:07:20,181 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 10:07:20,181 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 10:07:20,181 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 10:07:20,182 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 10:07:20,182 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 10:07:20,183 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 10:07:20,183 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 10:07:20,184 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 10:07:20,184 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 10:07:20,184 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 10:07:20,184 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 10:07:20,184 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 10:07:20,185 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 10:07:20,185 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 10:07:20,185 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 10:07:20,185 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 10:07:20,185 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 10:07:20,186 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 10:07:20,187 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 10:07:20,188 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 10:07:20,188 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 10:07:20,188 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:07:20,188 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 10:07:20,188 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 10:07:20,189 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 10:07:20,189 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 10:07:20,189 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 10:07:20,189 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 10:07:20,190 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 10:07:20,190 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 10:07:20,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 10:07:20,259 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 10:07:20,264 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 10:07:20,266 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 10:07:20,266 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 10:07:20,268 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl [2019-02-18 10:07:20,268 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-unlimited.bpl' [2019-02-18 10:07:20,302 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 10:07:20,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 10:07:20,304 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 10:07:20,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 10:07:20,305 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 10:07:20,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:20" (1/1) ... [2019-02-18 10:07:20,335 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:20" (1/1) ... [2019-02-18 10:07:20,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 10:07:20,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 10:07:20,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 10:07:20,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 10:07:20,376 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:20" (1/1) ... [2019-02-18 10:07:20,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:20" (1/1) ... [2019-02-18 10:07:20,378 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:20" (1/1) ... [2019-02-18 10:07:20,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:20" (1/1) ... [2019-02-18 10:07:20,382 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:20" (1/1) ... [2019-02-18 10:07:20,386 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:20" (1/1) ... [2019-02-18 10:07:20,389 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:20" (1/1) ... [2019-02-18 10:07:20,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 10:07:20,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 10:07:20,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 10:07:20,394 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 10:07:20,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 10:07:20,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-18 10:07:20,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-18 10:07:20,883 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-18 10:07:20,884 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-02-18 10:07:20,885 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:07:20 BoogieIcfgContainer [2019-02-18 10:07:20,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 10:07:20,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 10:07:20,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 10:07:20,899 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 10:07:20,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 10:07:20" (1/2) ... [2019-02-18 10:07:20,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c56882 and model type speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 10:07:20, skipping insertion in model container [2019-02-18 10:07:20,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 10:07:20" (2/2) ... [2019-02-18 10:07:20,906 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-unlimited.bpl [2019-02-18 10:07:20,928 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 10:07:20,944 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-02-18 10:07:20,972 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-02-18 10:07:21,013 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 10:07:21,014 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 10:07:21,014 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 10:07:21,014 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 10:07:21,015 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 10:07:21,015 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 10:07:21,015 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 10:07:21,015 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 10:07:21,048 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-02-18 10:07:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-02-18 10:07:21,066 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:21,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-02-18 10:07:21,076 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:21,090 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-02-18 10:07:21,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:21,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:21,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:21,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:21,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:21,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:07:21,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 10:07:21,285 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:21,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:07:21,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:07:21,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:21,303 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-02-18 10:07:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:21,483 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-02-18 10:07:21,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:21,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-02-18 10:07:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:21,501 INFO L225 Difference]: With dead ends: 25 [2019-02-18 10:07:21,501 INFO L226 Difference]: Without dead ends: 20 [2019-02-18 10:07:21,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:21,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-18 10:07:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-02-18 10:07:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 10:07:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-02-18 10:07:21,543 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-02-18 10:07:21,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:21,547 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-02-18 10:07:21,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:07:21,548 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-02-18 10:07:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:07:21,548 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:21,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:07:21,549 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:21,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:21,550 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-02-18 10:07:21,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:21,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:21,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:21,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:21,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:21,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:21,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:21,736 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:07:21,738 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-02-18 10:07:21,803 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:21,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:22,738 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:22,740 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:07:22,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:22,748 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:22,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:22,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:22,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:22,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:22,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:22,989 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-18 10:07:23,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:23,282 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-18 10:07:23,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:23,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:23,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:07:23,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:23,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:07:23,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:07:23,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:23,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:23,885 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-02-18 10:07:23,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:07:23,889 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,155 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,172 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,214 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,252 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:24,293 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-18 10:07:24,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:24,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:07:24,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:24,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:24,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:24,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:24,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:24,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 10:07:24,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:24,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 10:07:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 10:07:24,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:07:24,831 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-02-18 10:07:25,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:25,186 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-02-18 10:07:25,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:07:25,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 10:07:25,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:25,188 INFO L225 Difference]: With dead ends: 39 [2019-02-18 10:07:25,188 INFO L226 Difference]: Without dead ends: 37 [2019-02-18 10:07:25,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 10:07:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-18 10:07:25,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-02-18 10:07:25,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 10:07:25,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-02-18 10:07:25,195 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-02-18 10:07:25,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:25,195 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-02-18 10:07:25,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 10:07:25,196 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-02-18 10:07:25,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:07:25,196 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:25,196 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:07:25,197 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:25,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:25,197 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-02-18 10:07:25,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:25,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:25,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:25,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:25,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:25,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:25,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:25,374 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:07:25,375 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-02-18 10:07:25,377 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:25,378 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:28,119 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:28,119 INFO L272 AbstractInterpreter]: Visited 3 different actions 11 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:07:28,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:28,120 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:28,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:28,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:28,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:28,137 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:28,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:28,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:28,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:28,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:07:28,305 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:28,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:28,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:28,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:07:28,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:07:28,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:28,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:28,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:07:28,427 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:28,499 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:28,531 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:28,545 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:28,560 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:28,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:28,618 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-18 10:07:28,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:28,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 10:07:28,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-18 10:07:28,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-18 10:07:28,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:231 [2019-02-18 10:07:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:28,987 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:29,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 10:07:29,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 10:07:29,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:29,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:07:29,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:07:29,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 10:07:29,019 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-02-18 10:07:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:29,079 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-02-18 10:07:29,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:29,081 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 10:07:29,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:29,082 INFO L225 Difference]: With dead ends: 18 [2019-02-18 10:07:29,082 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 10:07:29,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 10:07:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 10:07:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-18 10:07:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 10:07:29,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-02-18 10:07:29,087 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-02-18 10:07:29,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:29,088 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-02-18 10:07:29,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:07:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-02-18 10:07:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:07:29,088 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:29,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:07:29,089 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:29,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:29,089 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-02-18 10:07:29,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:29,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:29,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:29,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:29,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:29,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:29,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:29,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:07:29,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-18 10:07:29,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:29,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-18 10:07:29,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-18 10:07:29,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:29,134 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-02-18 10:07:29,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:29,184 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-02-18 10:07:29,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:29,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-18 10:07:29,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:29,187 INFO L225 Difference]: With dead ends: 21 [2019-02-18 10:07:29,187 INFO L226 Difference]: Without dead ends: 20 [2019-02-18 10:07:29,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-18 10:07:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-18 10:07:29,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-02-18 10:07:29,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-18 10:07:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-02-18 10:07:29,191 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-02-18 10:07:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:29,192 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-02-18 10:07:29,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-18 10:07:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-02-18 10:07:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 10:07:29,193 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:29,193 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 10:07:29,193 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:29,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:29,193 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-02-18 10:07:29,194 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:29,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:29,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:29,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:29,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:29,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:29,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:29,274 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-02-18 10:07:29,274 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-02-18 10:07:29,277 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:29,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:29,564 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:29,564 INFO L272 AbstractInterpreter]: Visited 3 different actions 5 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:07:29,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:29,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:29,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:29,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:29,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:29,581 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:29,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:29,728 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-18 10:07:29,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:07:29,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:07:29,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:29,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:29,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:07:29,778 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,802 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,856 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,880 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:29,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:29,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:29,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:30,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:07:30,013 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,027 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,036 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:30,060 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-18 10:07:30,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:07:30,110 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:30,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:30,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:30,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:30,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 10:07:30,186 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:30,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 10:07:30,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 10:07:30,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:07:30,187 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-02-18 10:07:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:30,336 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-02-18 10:07:30,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:07:30,340 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-02-18 10:07:30,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:30,341 INFO L225 Difference]: With dead ends: 39 [2019-02-18 10:07:30,341 INFO L226 Difference]: Without dead ends: 38 [2019-02-18 10:07:30,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 10:07:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-18 10:07:30,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-02-18 10:07:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-18 10:07:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-02-18 10:07:30,346 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-02-18 10:07:30,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:30,346 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-02-18 10:07:30,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 10:07:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-02-18 10:07:30,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:30,347 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:30,347 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:30,347 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:30,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:30,347 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-02-18 10:07:30,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:30,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:30,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:30,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:30,349 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:30,404 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:30,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:30,404 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:30,404 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:30,405 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-02-18 10:07:30,407 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:30,407 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:30,818 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:30,818 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:30,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:30,819 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:30,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:30,819 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:30,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:30,832 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:30,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:30,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:07:30,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:07:30,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:30,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:30,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:30,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:07:30,918 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,945 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,978 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:30,988 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:31,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:31,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:31,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:07:31,192 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:31,201 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:31,210 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:31,232 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:31,232 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 10:07:31,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-18 10:07:31,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:07:31,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:07:31,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:74 [2019-02-18 10:07:31,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-02-18 10:07:31,562 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-18 10:07:31,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:31,777 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:31,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-18 10:07:31,779 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:31,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-18 10:07:31,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:96, output treesize:167 [2019-02-18 10:07:32,824 WARN L181 SmtUtils]: Spent 902.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 65 [2019-02-18 10:07:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:32,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:32,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:32,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:32,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:32,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:32,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:32,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:32,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:32,897 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-02-18 10:07:33,578 WARN L181 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 53 [2019-02-18 10:07:33,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:33,805 INFO L93 Difference]: Finished difference Result 59 states and 105 transitions. [2019-02-18 10:07:33,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:07:33,806 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:07:33,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:33,808 INFO L225 Difference]: With dead ends: 59 [2019-02-18 10:07:33,808 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 10:07:33,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:07:33,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 10:07:33,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 20. [2019-02-18 10:07:33,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-18 10:07:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 59 transitions. [2019-02-18 10:07:33,816 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 59 transitions. Word has length 4 [2019-02-18 10:07:33,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:33,816 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 59 transitions. [2019-02-18 10:07:33,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:33,816 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 59 transitions. [2019-02-18 10:07:33,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:33,817 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:33,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:33,817 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:33,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:33,818 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-02-18 10:07:33,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:33,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:33,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:33,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:33,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:33,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:33,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:33,862 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:33,863 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-02-18 10:07:33,863 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:33,864 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:34,083 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:34,084 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:07:34,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:34,084 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:34,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:34,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:34,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:34,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:34,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:34,101 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:34,105 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:07:34,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:07:34,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:07:34,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:07:34,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 10:07:34,169 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,211 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,240 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:07:34,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:07:34,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:07:34,287 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,295 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,304 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:34,324 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-18 10:07:34,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:34,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-18 10:07:34,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:34,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:34,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:29 [2019-02-18 10:07:34,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:34,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:34,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 10:07:34,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-02-18 10:07:34,427 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:34,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:07:34,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:07:34,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:07:34,428 INFO L87 Difference]: Start difference. First operand 20 states and 59 transitions. Second operand 4 states. [2019-02-18 10:07:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:34,524 INFO L93 Difference]: Finished difference Result 25 states and 74 transitions. [2019-02-18 10:07:34,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:34,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 10:07:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:34,529 INFO L225 Difference]: With dead ends: 25 [2019-02-18 10:07:34,529 INFO L226 Difference]: Without dead ends: 24 [2019-02-18 10:07:34,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:07:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-18 10:07:34,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-02-18 10:07:34,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-18 10:07:34,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 73 transitions. [2019-02-18 10:07:34,543 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 73 transitions. Word has length 4 [2019-02-18 10:07:34,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:34,544 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 73 transitions. [2019-02-18 10:07:34,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:07:34,547 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 73 transitions. [2019-02-18 10:07:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:34,548 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:34,548 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:34,548 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:34,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:34,549 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-02-18 10:07:34,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:34,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:34,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:34,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:34,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:34,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:34,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:34,718 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:34,718 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-02-18 10:07:34,719 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:34,720 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:35,029 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:35,029 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:35,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:35,030 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:35,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:35,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:35,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:35,039 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:35,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:35,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:07:35,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:07:35,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:35,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:35,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:07:35,110 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,136 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,160 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:35,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:35,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:07:35,272 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,279 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,288 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:35,310 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 10:07:35,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:07:35,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:35,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:35,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:35,427 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:35,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-18 10:07:35,429 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:35,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:35,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:29 [2019-02-18 10:07:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:35,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:35,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:35,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:35,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:35,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:35,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:35,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:35,525 INFO L87 Difference]: Start difference. First operand 23 states and 73 transitions. Second operand 8 states. [2019-02-18 10:07:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:35,958 INFO L93 Difference]: Finished difference Result 56 states and 117 transitions. [2019-02-18 10:07:35,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:07:35,959 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:07:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:35,961 INFO L225 Difference]: With dead ends: 56 [2019-02-18 10:07:35,961 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 10:07:35,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:35,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 10:07:35,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 24. [2019-02-18 10:07:35,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-18 10:07:35,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 79 transitions. [2019-02-18 10:07:35,969 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 79 transitions. Word has length 4 [2019-02-18 10:07:35,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:35,970 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 79 transitions. [2019-02-18 10:07:35,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:35,970 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 79 transitions. [2019-02-18 10:07:35,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:35,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:35,971 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:35,971 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:35,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:35,971 INFO L82 PathProgramCache]: Analyzing trace with hash 941276, now seen corresponding path program 1 times [2019-02-18 10:07:35,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:35,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:35,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:35,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:36,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:36,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:36,031 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:36,031 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:36,031 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [23] [2019-02-18 10:07:36,032 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:36,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:36,345 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:36,345 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:36,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:36,346 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:36,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:36,346 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:36,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:36,367 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:36,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:36,531 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-18 10:07:36,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:36,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:36,844 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-18 10:07:36,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:36,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:36,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:36,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:36,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:36,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:36,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:36,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:07:36,884 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:36,893 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:36,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:36,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:07:36,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:07:36,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:36,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:36,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:07:36,931 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:36,949 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:36,963 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:36,976 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:36,984 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:37,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:37,006 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 10:07:37,048 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:07:37,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:37,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:37,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:37,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,088 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:37,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 10:07:37,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:37,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:37,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:37,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:37,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:37,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:37,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:37,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:37,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:37,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:37,181 INFO L87 Difference]: Start difference. First operand 24 states and 79 transitions. Second operand 8 states. [2019-02-18 10:07:37,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:37,556 INFO L93 Difference]: Finished difference Result 52 states and 120 transitions. [2019-02-18 10:07:37,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:07:37,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:07:37,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:37,557 INFO L225 Difference]: With dead ends: 52 [2019-02-18 10:07:37,557 INFO L226 Difference]: Without dead ends: 48 [2019-02-18 10:07:37,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:37,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-18 10:07:37,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 26. [2019-02-18 10:07:37,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 10:07:37,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-18 10:07:37,566 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-02-18 10:07:37,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:37,567 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-18 10:07:37,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:37,567 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-18 10:07:37,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:37,567 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:37,567 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:37,568 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:37,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:37,568 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-02-18 10:07:37,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:37,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:37,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:37,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:37,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:37,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:37,618 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:37,618 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-02-18 10:07:37,619 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:37,619 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:39,278 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:39,278 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:07:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:39,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:39,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:39,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:39,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:39,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:39,309 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:39,328 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:07:39,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:07:39,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:07:39,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:07:39,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:07:39,375 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,402 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,415 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,425 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,456 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:07:39,470 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:07:39,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:07:39,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:07:39,581 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,594 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,609 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,625 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:39,677 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-18 10:07:39,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:39,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:07:39,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:39,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:39,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-18 10:07:39,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:39,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:39,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:39,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 10:07:39,781 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:39,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 10:07:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 10:07:39,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:07:39,782 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 6 states. [2019-02-18 10:07:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:39,919 INFO L93 Difference]: Finished difference Result 42 states and 110 transitions. [2019-02-18 10:07:39,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:07:39,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 10:07:39,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:39,920 INFO L225 Difference]: With dead ends: 42 [2019-02-18 10:07:39,920 INFO L226 Difference]: Without dead ends: 41 [2019-02-18 10:07:39,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 10:07:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-18 10:07:39,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 26. [2019-02-18 10:07:39,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 10:07:39,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 90 transitions. [2019-02-18 10:07:39,929 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 90 transitions. Word has length 4 [2019-02-18 10:07:39,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:39,929 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 90 transitions. [2019-02-18 10:07:39,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 10:07:39,930 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 90 transitions. [2019-02-18 10:07:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:39,930 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:39,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:39,931 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:39,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:39,931 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-02-18 10:07:39,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:39,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:39,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:39,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:39,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:39,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:39,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:39,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:39,997 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:39,997 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-02-18 10:07:39,999 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:39,999 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:40,621 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:40,621 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:40,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:40,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:40,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:40,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:40,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:40,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:40,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:40,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:40,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:07:40,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:07:40,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:40,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:40,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:07:40,707 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,740 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,755 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,766 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,812 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:07:40,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:07:40,878 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,879 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:07:40,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,923 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:40,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:07:40,928 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,943 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,958 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:40,974 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:41,008 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-18 10:07:41,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:07:41,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:41,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-18 10:07:41,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,096 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:41,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 10:07:41,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:41,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:41,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-18 10:07:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:41,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:41,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:41,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:41,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:41,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:41,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:41,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:41,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:41,242 INFO L87 Difference]: Start difference. First operand 26 states and 90 transitions. Second operand 8 states. [2019-02-18 10:07:41,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:41,618 INFO L93 Difference]: Finished difference Result 54 states and 131 transitions. [2019-02-18 10:07:41,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:07:41,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:07:41,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:41,620 INFO L225 Difference]: With dead ends: 54 [2019-02-18 10:07:41,620 INFO L226 Difference]: Without dead ends: 53 [2019-02-18 10:07:41,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-18 10:07:41,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 27. [2019-02-18 10:07:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-18 10:07:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 96 transitions. [2019-02-18 10:07:41,630 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 96 transitions. Word has length 4 [2019-02-18 10:07:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:41,630 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 96 transitions. [2019-02-18 10:07:41,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:41,630 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 96 transitions. [2019-02-18 10:07:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:41,631 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:41,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:41,631 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:41,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 1 times [2019-02-18 10:07:41,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:41,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:41,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:41,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:41,633 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:41,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:41,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:41,723 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:41,723 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-02-18 10:07:41,728 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:41,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:41,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:41,982 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:41,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:41,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:41,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:41,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:41,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:41,994 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:42,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:42,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:42,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,102 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:42,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:07:42,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:42,164 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:42,173 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:42,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:07:42,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:07:42,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:42,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:42,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:07:42,207 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:42,225 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:42,240 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:42,250 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:42,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:42,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:42,281 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-18 10:07:42,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:07:42,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:42,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:42,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:42,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:42,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 10:07:42,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:42,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:42,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-18 10:07:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:42,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:42,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:42,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:42,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:07:42,444 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:42,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:42,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:42,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:07:42,445 INFO L87 Difference]: Start difference. First operand 27 states and 96 transitions. Second operand 8 states. [2019-02-18 10:07:42,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:42,814 INFO L93 Difference]: Finished difference Result 63 states and 165 transitions. [2019-02-18 10:07:42,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:07:42,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:07:42,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:42,815 INFO L225 Difference]: With dead ends: 63 [2019-02-18 10:07:42,815 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 10:07:42,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:07:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 10:07:42,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 32. [2019-02-18 10:07:42,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 10:07:42,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 113 transitions. [2019-02-18 10:07:42,824 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 113 transitions. Word has length 4 [2019-02-18 10:07:42,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:42,825 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 113 transitions. [2019-02-18 10:07:42,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 113 transitions. [2019-02-18 10:07:42,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:42,825 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:42,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:42,825 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:42,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:42,826 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-02-18 10:07:42,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:42,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:42,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:42,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:42,827 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:42,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:42,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:07:42,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 10:07:42,897 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:07:42,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:07:42,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:07:42,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 10:07:42,898 INFO L87 Difference]: Start difference. First operand 32 states and 113 transitions. Second operand 4 states. [2019-02-18 10:07:42,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:42,970 INFO L93 Difference]: Finished difference Result 41 states and 126 transitions. [2019-02-18 10:07:42,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:07:42,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-18 10:07:42,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:42,971 INFO L225 Difference]: With dead ends: 41 [2019-02-18 10:07:42,971 INFO L226 Difference]: Without dead ends: 40 [2019-02-18 10:07:42,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 10:07:42,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-18 10:07:42,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-02-18 10:07:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 10:07:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 118 transitions. [2019-02-18 10:07:42,982 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 118 transitions. Word has length 4 [2019-02-18 10:07:42,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:42,982 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 118 transitions. [2019-02-18 10:07:42,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:07:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 118 transitions. [2019-02-18 10:07:42,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:42,983 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:42,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:42,983 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:42,983 INFO L82 PathProgramCache]: Analyzing trace with hash 933712, now seen corresponding path program 2 times [2019-02-18 10:07:42,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:42,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:42,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:42,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:42,985 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:42,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:43,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:43,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:43,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:43,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:43,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:43,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:43,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:43,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:43,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:43,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 10:07:43,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:43,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:43,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:07:43,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:07:43,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:43,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:43,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:07:43,159 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,190 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,205 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,218 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:07:43,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:07:43,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:07:43,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:07:43,394 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,409 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,423 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,438 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:43,470 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-18 10:07:43,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,491 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:07:43,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:43,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-18 10:07:43,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:43,560 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:43,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 79 [2019-02-18 10:07:43,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:43,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:43,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:44 [2019-02-18 10:07:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:43,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:43,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:43,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:43,657 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:43,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:43,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:43,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:43,658 INFO L87 Difference]: Start difference. First operand 33 states and 118 transitions. Second operand 8 states. [2019-02-18 10:07:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:44,035 INFO L93 Difference]: Finished difference Result 57 states and 149 transitions. [2019-02-18 10:07:44,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:07:44,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:07:44,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:44,037 INFO L225 Difference]: With dead ends: 57 [2019-02-18 10:07:44,038 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 10:07:44,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 10:07:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2019-02-18 10:07:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-18 10:07:44,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 117 transitions. [2019-02-18 10:07:44,049 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 117 transitions. Word has length 4 [2019-02-18 10:07:44,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:44,049 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 117 transitions. [2019-02-18 10:07:44,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:44,049 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 117 transitions. [2019-02-18 10:07:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:44,050 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:44,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:44,050 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:44,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:44,051 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-02-18 10:07:44,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:44,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:44,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:44,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:44,052 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:44,089 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:44,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:44,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:44,090 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:44,090 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-02-18 10:07:44,092 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:44,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:44,302 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:44,303 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:44,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:44,303 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:44,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:44,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:44,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:44,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:44,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:44,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:44,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:44,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:07:44,426 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,437 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,449 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:07:44,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:07:44,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:44,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:44,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:07:44,487 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,508 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,522 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,532 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,541 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:44,562 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-18 10:07:44,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:07:44,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:44,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:44,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:44,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 10:07:44,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:44,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:44,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:44,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:44,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:44,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:44,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:07:44,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:44,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:44,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:44,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:07:44,712 INFO L87 Difference]: Start difference. First operand 33 states and 117 transitions. Second operand 8 states. [2019-02-18 10:07:45,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:45,036 INFO L93 Difference]: Finished difference Result 61 states and 173 transitions. [2019-02-18 10:07:45,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:07:45,036 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:07:45,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:45,037 INFO L225 Difference]: With dead ends: 61 [2019-02-18 10:07:45,038 INFO L226 Difference]: Without dead ends: 60 [2019-02-18 10:07:45,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:45,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-18 10:07:45,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2019-02-18 10:07:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 10:07:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 135 transitions. [2019-02-18 10:07:45,050 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 135 transitions. Word has length 4 [2019-02-18 10:07:45,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:45,050 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 135 transitions. [2019-02-18 10:07:45,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 135 transitions. [2019-02-18 10:07:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:45,051 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:45,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:45,051 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:45,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:45,051 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-02-18 10:07:45,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:45,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:45,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:45,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:45,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:45,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:45,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:45,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:45,132 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:45,133 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-02-18 10:07:45,134 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:45,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:45,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:45,298 INFO L272 AbstractInterpreter]: Visited 4 different actions 6 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:07:45,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:45,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:45,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:45,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:45,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:45,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:45,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:45,325 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:07:45,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:07:45,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:07:45,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:07:45,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,403 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:07:45,405 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,431 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,445 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,455 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,488 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:07:45,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:07:45,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:07:45,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,594 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:07:45,600 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,615 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,631 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,649 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:45,737 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-18 10:07:45,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:45,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:07:45,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:45,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:45,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-18 10:07:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:45,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:45,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:45,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:45,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-18 10:07:45,866 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:45,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-18 10:07:45,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-18 10:07:45,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:07:45,866 INFO L87 Difference]: Start difference. First operand 36 states and 135 transitions. Second operand 6 states. [2019-02-18 10:07:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:46,007 INFO L93 Difference]: Finished difference Result 53 states and 161 transitions. [2019-02-18 10:07:46,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:07:46,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-02-18 10:07:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:46,008 INFO L225 Difference]: With dead ends: 53 [2019-02-18 10:07:46,008 INFO L226 Difference]: Without dead ends: 52 [2019-02-18 10:07:46,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-02-18 10:07:46,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-18 10:07:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 37. [2019-02-18 10:07:46,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-18 10:07:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 141 transitions. [2019-02-18 10:07:46,022 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 141 transitions. Word has length 4 [2019-02-18 10:07:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:46,023 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 141 transitions. [2019-02-18 10:07:46,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-18 10:07:46,023 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 141 transitions. [2019-02-18 10:07:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-18 10:07:46,023 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:46,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-18 10:07:46,024 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:46,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:46,024 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-02-18 10:07:46,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:46,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:46,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:46,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:46,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:46,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:46,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:46,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:46,343 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-18 10:07:46,343 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-02-18 10:07:46,344 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:46,344 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:46,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:46,563 INFO L272 AbstractInterpreter]: Visited 4 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:46,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:46,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:46,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:46,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:46,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:46,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:46,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:46,772 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-02-18 10:07:46,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:07:46,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:07:46,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:46,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:46,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:07:46,810 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,839 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:46,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:07:46,933 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,934 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:07:46,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:46,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:07:47,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:07:47,041 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:47,058 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:47,073 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:47,089 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:47,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:47,162 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-18 10:07:47,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:07:47,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:47,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:47,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-18 10:07:47,447 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-02-18 10:07:47,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,521 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:47,616 INFO L303 Elim1Store]: Index analysis took 164 ms [2019-02-18 10:07:47,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 10:07:47,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:47,690 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:47,690 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-02-18 10:07:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:47,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:47,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:47,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:47,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:47,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:47,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:47,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:47,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:47,765 INFO L87 Difference]: Start difference. First operand 37 states and 141 transitions. Second operand 8 states. [2019-02-18 10:07:48,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:48,101 INFO L93 Difference]: Finished difference Result 69 states and 192 transitions. [2019-02-18 10:07:48,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:07:48,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-02-18 10:07:48,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:48,102 INFO L225 Difference]: With dead ends: 69 [2019-02-18 10:07:48,102 INFO L226 Difference]: Without dead ends: 68 [2019-02-18 10:07:48,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:48,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-18 10:07:48,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 39. [2019-02-18 10:07:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 10:07:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 153 transitions. [2019-02-18 10:07:48,113 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 153 transitions. Word has length 4 [2019-02-18 10:07:48,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:48,113 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 153 transitions. [2019-02-18 10:07:48,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 153 transitions. [2019-02-18 10:07:48,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:48,114 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:48,114 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-18 10:07:48,114 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:48,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:48,115 INFO L82 PathProgramCache]: Analyzing trace with hash 29182896, now seen corresponding path program 2 times [2019-02-18 10:07:48,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:48,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:48,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:48,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:48,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:48,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:48,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:48,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:48,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:48,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:48,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:48,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:48,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:48,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:07:48,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:48,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:48,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:07:48,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:07:48,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:48,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:48,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:07:48,322 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,519 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,548 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:07:48,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:07:48,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:07:48,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:07:48,707 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,723 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,739 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,755 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:48,786 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:69, output treesize:66 [2019-02-18 10:07:48,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 10:07:48,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:48,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-18 10:07:48,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 78 [2019-02-18 10:07:48,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:48,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:48,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:50 [2019-02-18 10:07:48,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:48,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-18 10:07:48,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:49,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:49,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-02-18 10:07:49,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:49,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:49,040 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:49,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:49,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-18 10:07:49,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:49,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:07:49,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:07:49,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:07:49,060 INFO L87 Difference]: Start difference. First operand 39 states and 153 transitions. Second operand 9 states. [2019-02-18 10:07:49,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:49,438 INFO L93 Difference]: Finished difference Result 73 states and 219 transitions. [2019-02-18 10:07:49,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:07:49,438 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-18 10:07:49,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:49,439 INFO L225 Difference]: With dead ends: 73 [2019-02-18 10:07:49,440 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 10:07:49,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:49,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 10:07:49,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 42. [2019-02-18 10:07:49,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-18 10:07:49,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 171 transitions. [2019-02-18 10:07:49,451 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 171 transitions. Word has length 5 [2019-02-18 10:07:49,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:49,451 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 171 transitions. [2019-02-18 10:07:49,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:07:49,452 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 171 transitions. [2019-02-18 10:07:49,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:49,452 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:49,452 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:49,453 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:49,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:49,453 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-02-18 10:07:49,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:49,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:49,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:49,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:49,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:49,735 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-02-18 10:07:49,756 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:49,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:49,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:49,756 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:07:49,757 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-02-18 10:07:49,758 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:49,758 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:50,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:50,047 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:50,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:50,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:50,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:50,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:50,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:50,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:50,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:50,071 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:07:50,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:07:50,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:07:50,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:07:50,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:07:50,116 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,150 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,174 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,184 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,204 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:07:50,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:07:50,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:07:50,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:07:50,369 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,384 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,398 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,414 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:50,443 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:07:50,523 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-18 10:07:50,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:50,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 10:07:50,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:50,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-02-18 10:07:50,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:50,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:50,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:36 [2019-02-18 10:07:50,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:50,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:50,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:50,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:50,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:07:50,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:50,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:50,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:50,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:07:50,662 INFO L87 Difference]: Start difference. First operand 42 states and 171 transitions. Second operand 8 states. [2019-02-18 10:07:51,082 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-02-18 10:07:51,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:51,416 INFO L93 Difference]: Finished difference Result 84 states and 258 transitions. [2019-02-18 10:07:51,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:07:51,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 10:07:51,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:51,418 INFO L225 Difference]: With dead ends: 84 [2019-02-18 10:07:51,418 INFO L226 Difference]: Without dead ends: 78 [2019-02-18 10:07:51,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:07:51,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-18 10:07:51,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2019-02-18 10:07:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-18 10:07:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 218 transitions. [2019-02-18 10:07:51,434 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 218 transitions. Word has length 5 [2019-02-18 10:07:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:51,434 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 218 transitions. [2019-02-18 10:07:51,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 218 transitions. [2019-02-18 10:07:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:51,435 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:51,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:51,435 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:51,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-02-18 10:07:51,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:51,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:51,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:51,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:51,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:51,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:51,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:51,587 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:07:51,588 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-02-18 10:07:51,589 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:51,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:51,917 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:51,918 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:07:51,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:51,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:51,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:51,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:51,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:51,926 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:51,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:51,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:07:51,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:07:51,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:51,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:51,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:51,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:51,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:51,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:51,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:52,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:07:52,000 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,023 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,036 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:52,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:52,106 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:52,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:52,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:52,135 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:52,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:52,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:52,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:52,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:07:52,138 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,154 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,163 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:52,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:52,184 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-18 10:07:52,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:52,346 INFO L303 Elim1Store]: Index analysis took 139 ms [2019-02-18 10:07:52,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 54 [2019-02-18 10:07:52,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:07:53,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:07:53,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:74 [2019-02-18 10:07:53,894 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-02-18 10:07:53,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:53,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-02-18 10:07:53,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-18 10:07:54,109 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,111 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,113 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:54,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-18 10:07:54,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:54,226 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-18 10:07:54,226 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:96, output treesize:167 [2019-02-18 10:07:54,501 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-02-18 10:07:54,509 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,515 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,516 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,518 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:54,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 86 [2019-02-18 10:07:54,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:54,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-18 10:07:54,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:54,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,694 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:54,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-02-18 10:07:54,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:54,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:54,783 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:54,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-02-18 10:07:54,784 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:54,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-18 10:07:54,850 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:121 [2019-02-18 10:07:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:54,936 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:55,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:55,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 10:07:55,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:55,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:07:55,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:07:55,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:07:55,015 INFO L87 Difference]: Start difference. First operand 48 states and 218 transitions. Second operand 10 states. [2019-02-18 10:07:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:55,858 INFO L93 Difference]: Finished difference Result 109 states and 322 transitions. [2019-02-18 10:07:55,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 10:07:55,858 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 10:07:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:55,860 INFO L225 Difference]: With dead ends: 109 [2019-02-18 10:07:55,860 INFO L226 Difference]: Without dead ends: 107 [2019-02-18 10:07:55,861 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-02-18 10:07:55,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-18 10:07:55,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 51. [2019-02-18 10:07:55,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-18 10:07:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 236 transitions. [2019-02-18 10:07:55,878 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 236 transitions. Word has length 5 [2019-02-18 10:07:55,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:55,878 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 236 transitions. [2019-02-18 10:07:55,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:07:55,879 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 236 transitions. [2019-02-18 10:07:55,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:55,879 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:55,879 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:55,879 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:55,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:55,880 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-02-18 10:07:55,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:55,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:55,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:55,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:56,149 WARN L181 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-02-18 10:07:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:07:56,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:56,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:56,163 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:07:56,163 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-02-18 10:07:56,164 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:56,164 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:56,381 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:56,381 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:56,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:56,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:56,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:56,382 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:56,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:56,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:56,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:56,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:07:56,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:07:56,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:56,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:56,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:07:56,448 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:56,478 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:56,492 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:56,503 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:56,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:56,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:07:56,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:07:56,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:07:56,591 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:56,601 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:56,610 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:56,631 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:56,632 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 10:07:56,815 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:07:56,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:56,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:56,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:07:56,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:56,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 10:07:56,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:56,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:56,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:27 [2019-02-18 10:07:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:56,898 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:56,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:56,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:56,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:56,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:56,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:56,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:56,939 INFO L87 Difference]: Start difference. First operand 51 states and 236 transitions. Second operand 8 states. [2019-02-18 10:07:57,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:57,287 INFO L93 Difference]: Finished difference Result 77 states and 292 transitions. [2019-02-18 10:07:57,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:07:57,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 10:07:57,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:57,289 INFO L225 Difference]: With dead ends: 77 [2019-02-18 10:07:57,289 INFO L226 Difference]: Without dead ends: 76 [2019-02-18 10:07:57,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:07:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-18 10:07:57,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2019-02-18 10:07:57,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-18 10:07:57,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 261 transitions. [2019-02-18 10:07:57,308 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 261 transitions. Word has length 5 [2019-02-18 10:07:57,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:57,308 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 261 transitions. [2019-02-18 10:07:57,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:57,308 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 261 transitions. [2019-02-18 10:07:57,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:57,309 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:57,309 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:57,309 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:57,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:57,310 INFO L82 PathProgramCache]: Analyzing trace with hash 29175642, now seen corresponding path program 2 times [2019-02-18 10:07:57,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:57,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:57,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:57,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:57,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:57,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:57,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:57,416 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:07:57,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:07:57,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:57,416 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:57,425 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:07:57,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:07:57,431 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:07:57,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:07:57,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:57,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:07:57,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:07:57,526 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,527 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:07:57,570 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:07:57,577 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,593 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,609 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:07:57,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:07:57,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:07:57,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:07:57,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:07:57,661 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,684 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,698 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,709 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,718 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:57,748 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 10:07:57,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 10:07:57,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:57,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 10:07:57,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,837 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:07:57,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-18 10:07:57,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:57,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-02-18 10:07:57,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,918 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,920 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,924 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,926 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,928 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:57,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-02-18 10:07:57,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:57,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:57,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-18 10:07:58,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:58,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:58,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:58,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:58,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:07:58,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:58,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:07:58,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:07:58,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:58,081 INFO L87 Difference]: Start difference. First operand 55 states and 261 transitions. Second operand 10 states. [2019-02-18 10:07:58,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:58,601 INFO L93 Difference]: Finished difference Result 88 states and 340 transitions. [2019-02-18 10:07:58,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:07:58,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 10:07:58,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:58,606 INFO L225 Difference]: With dead ends: 88 [2019-02-18 10:07:58,607 INFO L226 Difference]: Without dead ends: 83 [2019-02-18 10:07:58,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:07:58,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-18 10:07:58,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2019-02-18 10:07:58,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 10:07:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-02-18 10:07:58,624 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-02-18 10:07:58,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:58,624 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-02-18 10:07:58,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:07:58,624 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-02-18 10:07:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:58,624 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:58,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:58,625 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:58,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:58,625 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-02-18 10:07:58,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:58,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:58,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:07:58,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:58,626 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:58,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:58,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:07:58,780 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:07:58,780 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-02-18 10:07:58,782 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:07:58,782 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:07:58,998 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:07:58,998 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:07:58,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:58,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:07:58,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:07:58,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:07:59,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:59,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:07:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:07:59,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:07:59,020 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:07:59,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:07:59,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:07:59,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:07:59,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 10:07:59,086 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,103 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,116 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,125 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,153 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:07:59,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:07:59,190 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,191 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,193 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:07:59,195 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,203 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,212 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:59,231 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-18 10:07:59,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 10:07:59,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:59,279 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 10:07:59,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:07:59,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 10:07:59,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:07:59,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:07:59,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2019-02-18 10:07:59,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:59,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:07:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:07:59,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:07:59,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:07:59,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:07:59,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:07:59,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:07:59,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:07:59,371 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 8 states. [2019-02-18 10:07:59,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:07:59,649 INFO L93 Difference]: Finished difference Result 81 states and 298 transitions. [2019-02-18 10:07:59,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:07:59,650 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 10:07:59,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:07:59,651 INFO L225 Difference]: With dead ends: 81 [2019-02-18 10:07:59,651 INFO L226 Difference]: Without dead ends: 80 [2019-02-18 10:07:59,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:07:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-18 10:07:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-02-18 10:07:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-18 10:07:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 273 transitions. [2019-02-18 10:07:59,666 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 273 transitions. Word has length 5 [2019-02-18 10:07:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:07:59,667 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 273 transitions. [2019-02-18 10:07:59,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:07:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 273 transitions. [2019-02-18 10:07:59,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:07:59,667 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:07:59,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:07:59,668 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:07:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:07:59,668 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-02-18 10:07:59,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:07:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:59,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:07:59,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:07:59,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:07:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:00,207 WARN L181 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 16 [2019-02-18 10:08:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:00,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:00,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:00,370 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:08:00,370 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-02-18 10:08:00,371 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:00,371 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:00,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:00,798 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:08:00,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:00,799 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:00,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:00,799 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:00,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:00,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:00,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:00,985 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-02-18 10:08:01,021 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:08:01,140 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-02-18 10:08:01,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:08:01,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:08:01,179 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:01,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:08:01,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:01,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:01,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:08:01,228 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,243 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,256 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,267 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,276 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:01,297 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-18 10:08:01,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:08:01,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:01,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:08:01,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 10:08:01,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:01,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:08:01,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,446 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:01,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:01,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-18 10:08:01,448 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:01,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:01,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 10:08:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:01,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:01,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:01,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:01,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:08:01,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:01,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:08:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:08:01,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:08:01,562 INFO L87 Difference]: Start difference. First operand 61 states and 273 transitions. Second operand 10 states. [2019-02-18 10:08:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:02,028 INFO L93 Difference]: Finished difference Result 113 states and 415 transitions. [2019-02-18 10:08:02,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:08:02,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 10:08:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:02,030 INFO L225 Difference]: With dead ends: 113 [2019-02-18 10:08:02,030 INFO L226 Difference]: Without dead ends: 112 [2019-02-18 10:08:02,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:08:02,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-18 10:08:02,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 60. [2019-02-18 10:08:02,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-18 10:08:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 267 transitions. [2019-02-18 10:08:02,051 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 267 transitions. Word has length 5 [2019-02-18 10:08:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:02,051 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 267 transitions. [2019-02-18 10:08:02,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:08:02,051 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 267 transitions. [2019-02-18 10:08:02,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:08:02,051 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:02,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:08:02,052 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:02,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:02,052 INFO L82 PathProgramCache]: Analyzing trace with hash 29242478, now seen corresponding path program 1 times [2019-02-18 10:08:02,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:02,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:02,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:02,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:02,053 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:02,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:02,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:02,169 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:08:02,169 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [23] [2019-02-18 10:08:02,170 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:02,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:02,492 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:02,492 INFO L272 AbstractInterpreter]: Visited 5 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:08:02,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:02,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:02,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:02,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:02,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:02,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:02,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:02,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:08:02,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:08:02,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:02,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:02,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:08:02,576 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:02,597 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:02,611 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:02,623 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:02,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:02,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:08:02,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:08:02,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:08:02,729 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:02,738 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:02,748 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:02,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:02,769 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 10:08:02,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:02,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 10:08:02,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-18 10:08:03,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-18 10:08:03,055 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-02-18 10:08:03,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,183 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 69 [2019-02-18 10:08:03,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,288 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,288 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:03,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-02-18 10:08:03,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-18 10:08:03,366 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-18 10:08:03,425 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:96 [2019-02-18 10:08:03,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-02-18 10:08:03,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,622 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,627 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,631 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:03,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 77 [2019-02-18 10:08:03,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:03,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2019-02-18 10:08:03,702 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:03,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-18 10:08:03,743 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:130, output treesize:88 [2019-02-18 10:08:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:03,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:03,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:03,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-18 10:08:03,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:03,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:08:03,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:08:03,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:08:03,852 INFO L87 Difference]: Start difference. First operand 60 states and 267 transitions. Second operand 10 states. [2019-02-18 10:08:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:04,667 INFO L93 Difference]: Finished difference Result 137 states and 516 transitions. [2019-02-18 10:08:04,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 10:08:04,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 10:08:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:04,669 INFO L225 Difference]: With dead ends: 137 [2019-02-18 10:08:04,669 INFO L226 Difference]: Without dead ends: 136 [2019-02-18 10:08:04,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:08:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-02-18 10:08:04,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 93. [2019-02-18 10:08:04,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-18 10:08:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 468 transitions. [2019-02-18 10:08:04,702 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 468 transitions. Word has length 5 [2019-02-18 10:08:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:04,702 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 468 transitions. [2019-02-18 10:08:04,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:08:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 468 transitions. [2019-02-18 10:08:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:08:04,703 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:04,703 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:08:04,703 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:04,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:04,703 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-02-18 10:08:04,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:04,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:04,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:04,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:04,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:04,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:04,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:04,803 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:08:04,803 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-02-18 10:08:04,804 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:04,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:05,334 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:05,334 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:05,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:05,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:05,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:05,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:05,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:05,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:05,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:05,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:08:05,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:08:05,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:08:05,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:08:05,515 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,532 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,549 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:05,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:08:05,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:05,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:05,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:08:05,602 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,626 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,639 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,649 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,659 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:05,689 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-18 10:08:05,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,711 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:08:05,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:05,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-18 10:08:05,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,776 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:05,778 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:05,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 10:08:05,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:05,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:05,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-02-18 10:08:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:05,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:05,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:05,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:08:05,932 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:05,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:08:05,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:08:05,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:08:05,932 INFO L87 Difference]: Start difference. First operand 93 states and 468 transitions. Second operand 8 states. [2019-02-18 10:08:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:06,295 INFO L93 Difference]: Finished difference Result 120 states and 513 transitions. [2019-02-18 10:08:06,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:08:06,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 10:08:06,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:06,298 INFO L225 Difference]: With dead ends: 120 [2019-02-18 10:08:06,298 INFO L226 Difference]: Without dead ends: 119 [2019-02-18 10:08:06,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:08:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-18 10:08:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 96. [2019-02-18 10:08:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-18 10:08:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 486 transitions. [2019-02-18 10:08:06,341 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 486 transitions. Word has length 5 [2019-02-18 10:08:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:06,341 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 486 transitions. [2019-02-18 10:08:06,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:08:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 486 transitions. [2019-02-18 10:08:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:08:06,342 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:06,342 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:08:06,342 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-02-18 10:08:06,343 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:06,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:06,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:06,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:06,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:06,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:06,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:06,426 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:08:06,426 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-02-18 10:08:06,427 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:06,427 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:07,986 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:07,986 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:08:07,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:07,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:07,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:07,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:07,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:07,995 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:07,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:08,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:08,005 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:08,009 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:08,017 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,019 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:08:08,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:08:08,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,049 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:08:08,052 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:08,086 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:08,104 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:08,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:08,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:08,153 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:08:08,173 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:08:08,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:08:08,287 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,289 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:08:08,300 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:08,330 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:08,352 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:08,376 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:08,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:08,409 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-18 10:08:08,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:08,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:08:08,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:08,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:08,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-02-18 10:08:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:08,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:08,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 10:08:08,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 10:08:08,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:08:08,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:08:08,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:08:08,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-02-18 10:08:08,635 INFO L87 Difference]: Start difference. First operand 96 states and 486 transitions. Second operand 4 states. [2019-02-18 10:08:08,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:08,782 INFO L93 Difference]: Finished difference Result 105 states and 515 transitions. [2019-02-18 10:08:08,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:08:08,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 10:08:08,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:08,784 INFO L225 Difference]: With dead ends: 105 [2019-02-18 10:08:08,784 INFO L226 Difference]: Without dead ends: 104 [2019-02-18 10:08:08,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-02-18 10:08:08,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-18 10:08:08,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-02-18 10:08:08,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-18 10:08:08,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 513 transitions. [2019-02-18 10:08:08,834 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 513 transitions. Word has length 5 [2019-02-18 10:08:08,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:08,834 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 513 transitions. [2019-02-18 10:08:08,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:08:08,834 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 513 transitions. [2019-02-18 10:08:08,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:08:08,835 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:08,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:08:08,835 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:08,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:08,836 INFO L82 PathProgramCache]: Analyzing trace with hash 29235162, now seen corresponding path program 3 times [2019-02-18 10:08:08,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:08,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:08,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:08,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:08,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:09,435 WARN L181 SmtUtils]: Spent 536.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 21 [2019-02-18 10:08:09,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:09,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:09,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:09,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:08:09,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:08:09,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:09,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:09,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:08:09,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:08:09,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:08:09,560 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:08:09,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:09,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:08:09,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:08:09,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:09,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:09,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:08:09,613 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,631 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,646 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,655 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,666 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:08:09,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:08:09,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:08:09,757 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,767 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,775 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:09,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:09,796 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-18 10:08:09,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:09,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 10:08:09,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-18 10:08:10,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-02-18 10:08:10,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:231 [2019-02-18 10:08:10,157 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-02-18 10:08:10,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 69 [2019-02-18 10:08:10,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:10,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,263 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:10,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 51 [2019-02-18 10:08:10,264 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:10,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-18 10:08:10,351 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:10,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-18 10:08:10,437 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:10,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-18 10:08:10,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:197, output treesize:121 [2019-02-18 10:08:10,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,580 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:10,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 82 [2019-02-18 10:08:10,582 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:10,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,675 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,677 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,681 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:10,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-02-18 10:08:10,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:10,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-18 10:08:10,769 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:10,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:10,844 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:10,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-02-18 10:08:10,846 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:10,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-18 10:08:10,909 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:167, output treesize:123 [2019-02-18 10:08:10,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:10,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:11,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:11,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:08:11,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:11,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:08:11,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:08:11,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:08:11,049 INFO L87 Difference]: Start difference. First operand 103 states and 513 transitions. Second operand 10 states. [2019-02-18 10:08:11,437 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-02-18 10:08:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:11,710 INFO L93 Difference]: Finished difference Result 131 states and 560 transitions. [2019-02-18 10:08:11,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:08:11,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-02-18 10:08:11,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:11,712 INFO L225 Difference]: With dead ends: 131 [2019-02-18 10:08:11,712 INFO L226 Difference]: Without dead ends: 130 [2019-02-18 10:08:11,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:08:11,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-02-18 10:08:11,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 41. [2019-02-18 10:08:11,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-18 10:08:11,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 140 transitions. [2019-02-18 10:08:11,732 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 140 transitions. Word has length 5 [2019-02-18 10:08:11,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:11,732 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 140 transitions. [2019-02-18 10:08:11,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:08:11,732 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 140 transitions. [2019-02-18 10:08:11,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:08:11,733 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:11,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:08:11,733 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:11,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:11,733 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-02-18 10:08:11,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:11,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:11,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:08:11,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:11,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:11,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:11,904 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 16 [2019-02-18 10:08:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:11,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:11,920 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:11,920 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:08:11,920 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-02-18 10:08:11,921 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:11,921 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:12,441 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:12,441 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:12,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:12,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:12,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:12,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:12,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:12,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:12,462 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:12,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:12,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:08:12,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:08:12,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:08:12,507 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,538 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,561 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,593 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:08:12,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:08:12,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:08:12,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:08:12,690 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,704 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,718 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,734 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:12,762 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:08:12,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:08:12,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:12,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 10:08:12,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:12,861 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:12,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 76 [2019-02-18 10:08:12,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:12,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:12,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-02-18 10:08:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:12,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:12,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:12,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:08:12,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:12,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:08:12,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:08:12,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:08:12,952 INFO L87 Difference]: Start difference. First operand 41 states and 140 transitions. Second operand 8 states. [2019-02-18 10:08:13,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:13,656 INFO L93 Difference]: Finished difference Result 71 states and 187 transitions. [2019-02-18 10:08:13,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:08:13,657 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 10:08:13,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:13,658 INFO L225 Difference]: With dead ends: 71 [2019-02-18 10:08:13,658 INFO L226 Difference]: Without dead ends: 68 [2019-02-18 10:08:13,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:08:13,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-18 10:08:13,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2019-02-18 10:08:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-18 10:08:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 160 transitions. [2019-02-18 10:08:13,686 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 160 transitions. Word has length 5 [2019-02-18 10:08:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:13,687 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 160 transitions. [2019-02-18 10:08:13,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:08:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 160 transitions. [2019-02-18 10:08:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:08:13,687 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:13,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:08:13,687 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:13,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-02-18 10:08:13,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:13,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:13,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:13,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:13,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:13,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:13,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:13,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:13,806 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:08:13,806 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-02-18 10:08:13,807 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:13,807 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:14,007 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:14,007 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:14,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:14,008 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:14,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:14,008 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:14,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:14,018 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:14,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:14,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:08:14,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:08:14,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:08:14,120 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:14,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:08:14,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:14,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:14,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:08:14,221 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,237 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,251 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,262 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,272 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:14,294 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:52, output treesize:50 [2019-02-18 10:08:14,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:08:14,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:14,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:33 [2019-02-18 10:08:14,357 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,360 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:14,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-18 10:08:14,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:14,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:14,387 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-18 10:08:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:14,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:14,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:14,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:08:14,433 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:14,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:08:14,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:08:14,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:08:14,433 INFO L87 Difference]: Start difference. First operand 46 states and 160 transitions. Second operand 8 states. [2019-02-18 10:08:14,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:14,701 INFO L93 Difference]: Finished difference Result 73 states and 194 transitions. [2019-02-18 10:08:14,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:08:14,702 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 10:08:14,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:14,703 INFO L225 Difference]: With dead ends: 73 [2019-02-18 10:08:14,703 INFO L226 Difference]: Without dead ends: 72 [2019-02-18 10:08:14,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:08:14,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-18 10:08:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 47. [2019-02-18 10:08:14,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 10:08:14,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 166 transitions. [2019-02-18 10:08:14,727 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 166 transitions. Word has length 5 [2019-02-18 10:08:14,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:14,727 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 166 transitions. [2019-02-18 10:08:14,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:08:14,727 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 166 transitions. [2019-02-18 10:08:14,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:08:14,728 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:14,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:08:14,728 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:14,728 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-02-18 10:08:14,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:14,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:14,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:14,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:14,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:14,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:14,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:14,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:14,812 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:08:14,813 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-02-18 10:08:14,813 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:14,814 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:15,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:15,027 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:15,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:15,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:15,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:15,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:15,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:15,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:15,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:15,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:08:15,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:08:15,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:15,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:15,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:08:15,107 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:15,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:15,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:15,156 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:15,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:15,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:08:15,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:08:15,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:08:15,256 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:15,266 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:15,275 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:15,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:15,296 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 10:08:15,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:08:15,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:15,351 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:15,351 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:08:15,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:15,377 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:15,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 10:08:15,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:15,397 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:15,397 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-18 10:08:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:15,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:15,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:15,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:15,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-02-18 10:08:15,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:15,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:08:15,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:08:15,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:08:15,457 INFO L87 Difference]: Start difference. First operand 47 states and 166 transitions. Second operand 9 states. [2019-02-18 10:08:15,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:15,736 INFO L93 Difference]: Finished difference Result 66 states and 193 transitions. [2019-02-18 10:08:15,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:08:15,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-18 10:08:15,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:15,737 INFO L225 Difference]: With dead ends: 66 [2019-02-18 10:08:15,738 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 10:08:15,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:08:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 10:08:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 48. [2019-02-18 10:08:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-18 10:08:15,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 172 transitions. [2019-02-18 10:08:15,773 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 172 transitions. Word has length 5 [2019-02-18 10:08:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:15,774 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 172 transitions. [2019-02-18 10:08:15,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:08:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 172 transitions. [2019-02-18 10:08:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:08:15,774 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:15,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:08:15,775 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:15,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:15,775 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-02-18 10:08:15,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:15,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:15,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:15,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:15,776 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:15,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:08:15,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 10:08:15,860 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:08:15,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:08:15,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:08:15,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 10:08:15,861 INFO L87 Difference]: Start difference. First operand 48 states and 172 transitions. Second operand 4 states. [2019-02-18 10:08:15,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:15,926 INFO L93 Difference]: Finished difference Result 54 states and 182 transitions. [2019-02-18 10:08:15,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-18 10:08:15,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-18 10:08:15,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:15,928 INFO L225 Difference]: With dead ends: 54 [2019-02-18 10:08:15,928 INFO L226 Difference]: Without dead ends: 51 [2019-02-18 10:08:15,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-02-18 10:08:15,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-18 10:08:15,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2019-02-18 10:08:15,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-18 10:08:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 175 transitions. [2019-02-18 10:08:15,961 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 175 transitions. Word has length 5 [2019-02-18 10:08:15,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:15,961 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 175 transitions. [2019-02-18 10:08:15,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:08:15,961 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 175 transitions. [2019-02-18 10:08:15,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 10:08:15,962 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:15,962 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-18 10:08:15,962 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:15,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:15,962 INFO L82 PathProgramCache]: Analyzing trace with hash 28941284, now seen corresponding path program 1 times [2019-02-18 10:08:15,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:15,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:15,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:15,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:16,156 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2019-02-18 10:08:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:16,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:16,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:16,300 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 10:08:16,301 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-02-18 10:08:16,301 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:16,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:16,498 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:16,498 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:16,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:16,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:16,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:16,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:16,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:16,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:16,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:16,519 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:08:16,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:16,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:16,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:08:16,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:16,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:16,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:16,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:16,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:08:16,587 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:16,596 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:16,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:16,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:16,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:16,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:08:16,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:08:16,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 10:08:16,639 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:16,653 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:16,666 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:16,675 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:16,684 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:16,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:16,703 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-18 10:08:16,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:16,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:08:16,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:08:16,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:16,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:62 [2019-02-18 10:08:16,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:16,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:16,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:16,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:16,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 10:08:16,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:16,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:16,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-02-18 10:08:16,859 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:16,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:16,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:16,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:08:16,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:16,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:08:16,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:08:16,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:08:16,892 INFO L87 Difference]: Start difference. First operand 47 states and 175 transitions. Second operand 8 states. [2019-02-18 10:08:17,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:17,134 INFO L93 Difference]: Finished difference Result 83 states and 276 transitions. [2019-02-18 10:08:17,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:08:17,134 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-02-18 10:08:17,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:17,135 INFO L225 Difference]: With dead ends: 83 [2019-02-18 10:08:17,135 INFO L226 Difference]: Without dead ends: 82 [2019-02-18 10:08:17,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:08:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-18 10:08:17,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-02-18 10:08:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-18 10:08:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 241 transitions. [2019-02-18 10:08:17,182 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 241 transitions. Word has length 5 [2019-02-18 10:08:17,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:17,182 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 241 transitions. [2019-02-18 10:08:17,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:08:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 241 transitions. [2019-02-18 10:08:17,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:17,182 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:17,183 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 10:08:17,183 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:17,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:17,183 INFO L82 PathProgramCache]: Analyzing trace with hash 904687194, now seen corresponding path program 1 times [2019-02-18 10:08:17,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:17,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:17,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:17,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:17,184 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:17,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:17,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:17,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:17,254 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:17,254 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-02-18 10:08:17,256 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:17,256 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:17,410 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:17,410 INFO L272 AbstractInterpreter]: Visited 5 different actions 7 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:08:17,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:17,410 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:17,410 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:17,410 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:17,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:17,419 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:17,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:17,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:17,429 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:08:17,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:17,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:17,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:08:17,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:17,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:17,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:17,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:17,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:08:17,502 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:17,513 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:17,523 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:17,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:17,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:17,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:08:17,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:08:17,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 10:08:17,556 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:17,571 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:17,583 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:17,593 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:17,602 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:17,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:17,621 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-18 10:08:17,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:17,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 10:08:17,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:17,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:17,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 10:08:17,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:17,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:17,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:17,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:17,674 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:17,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2019-02-18 10:08:17,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:17,686 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:17,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:20 [2019-02-18 10:08:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:17,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:17,741 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:17,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:08:17,741 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:17,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:08:17,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:08:17,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:08:17,742 INFO L87 Difference]: Start difference. First operand 58 states and 241 transitions. Second operand 8 states. [2019-02-18 10:08:18,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:18,079 INFO L93 Difference]: Finished difference Result 86 states and 325 transitions. [2019-02-18 10:08:18,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:08:18,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 10:08:18,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:18,081 INFO L225 Difference]: With dead ends: 86 [2019-02-18 10:08:18,081 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 10:08:18,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:08:18,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 10:08:18,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2019-02-18 10:08:18,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-18 10:08:18,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 289 transitions. [2019-02-18 10:08:18,140 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 289 transitions. Word has length 6 [2019-02-18 10:08:18,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:18,140 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 289 transitions. [2019-02-18 10:08:18,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:08:18,141 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 289 transitions. [2019-02-18 10:08:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:18,141 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:18,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:18,141 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:18,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:18,142 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-02-18 10:08:18,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:18,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:18,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:18,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:18,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:18,281 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-18 10:08:18,723 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:18,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:18,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:18,724 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:18,724 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-02-18 10:08:18,725 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:18,725 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:19,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:19,004 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:08:19,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:19,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:19,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:19,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:19,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:19,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:19,018 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:19,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:08:19,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:08:19,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,134 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:08:19,277 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-02-18 10:08:19,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,285 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,286 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:08:19,287 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:19,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:19,319 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:19,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:19,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:19,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:08:19,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:19,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:19,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:08:19,378 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:19,401 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:19,414 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:19,425 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:19,435 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:19,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:19,465 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 10:08:19,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 10:08:19,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:19,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:19,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 10:08:19,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-18 10:08:19,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:19,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:19,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-02-18 10:08:19,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,652 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,653 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:19,659 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:19,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-18 10:08:19,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:19,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:19,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-18 10:08:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:19,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:19,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:19,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 10:08:19,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:19,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:08:19,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:08:19,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:08:19,836 INFO L87 Difference]: Start difference. First operand 66 states and 289 transitions. Second operand 10 states. [2019-02-18 10:08:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:20,346 INFO L93 Difference]: Finished difference Result 100 states and 357 transitions. [2019-02-18 10:08:20,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:08:20,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 10:08:20,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:20,348 INFO L225 Difference]: With dead ends: 100 [2019-02-18 10:08:20,348 INFO L226 Difference]: Without dead ends: 99 [2019-02-18 10:08:20,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:08:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-18 10:08:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 68. [2019-02-18 10:08:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-18 10:08:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 301 transitions. [2019-02-18 10:08:20,424 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 301 transitions. Word has length 6 [2019-02-18 10:08:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:20,424 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 301 transitions. [2019-02-18 10:08:20,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:08:20,424 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 301 transitions. [2019-02-18 10:08:20,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:20,424 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:20,424 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:20,425 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:20,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:20,425 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-02-18 10:08:20,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:20,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:20,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:20,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:20,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:20,550 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:20,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:20,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:20,551 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:20,551 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-02-18 10:08:20,552 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:20,552 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:20,851 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:20,852 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:08:20,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:20,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:20,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:20,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:20,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:20,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:20,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:20,869 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:08:20,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:20,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:20,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:08:20,942 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:20,943 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:20,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:20,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:20,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:08:20,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:20,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:20,991 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:20,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:20,993 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:20,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:20,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:08:20,997 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:21,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:21,030 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:21,050 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:21,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:21,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:21,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:08:21,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:08:21,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:08:21,086 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:21,108 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:21,120 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:21,129 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:21,139 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:21,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:21,167 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:08:21,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:08:21,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:21,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:21,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:08:21,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,256 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 10:08:21,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:21,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:21,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:08:21,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:21,302 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:21,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 10:08:21,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:21,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:21,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:08:21,340 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:21,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:21,375 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:21,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:21,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 10:08:21,394 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:21,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:08:21,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:08:21,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:08:21,395 INFO L87 Difference]: Start difference. First operand 68 states and 301 transitions. Second operand 10 states. [2019-02-18 10:08:21,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:21,899 INFO L93 Difference]: Finished difference Result 104 states and 381 transitions. [2019-02-18 10:08:21,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:08:21,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 10:08:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:21,901 INFO L225 Difference]: With dead ends: 104 [2019-02-18 10:08:21,902 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 10:08:21,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:08:21,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 10:08:21,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 74. [2019-02-18 10:08:21,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-18 10:08:21,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-02-18 10:08:21,999 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-02-18 10:08:21,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:21,999 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-02-18 10:08:21,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:08:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-02-18 10:08:22,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:22,000 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:22,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:22,000 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:22,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:22,000 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-02-18 10:08:22,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:22,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:22,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:22,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:22,002 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:22,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:22,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:22,068 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:22,068 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-02-18 10:08:22,069 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:22,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:22,379 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:22,380 INFO L272 AbstractInterpreter]: Visited 6 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:08:22,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:22,380 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:22,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:22,380 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:22,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:22,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:22,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:22,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:08:22,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:08:22,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:08:22,543 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:22,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:22,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:22,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:22,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:08:22,582 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:22,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:22,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:08:22,589 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:22,606 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:22,629 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:22,640 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:22,648 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:22,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:22,669 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-18 10:08:22,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:08:22,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:22,729 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:22,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:08:22,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,754 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 10:08:22,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:22,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:22,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:08:22,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:22,802 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:22,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 10:08:22,804 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:22,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:22,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:08:22,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:22,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:22,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:22,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 10:08:22,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:22,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:08:22,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:08:22,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:08:22,899 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 10 states. [2019-02-18 10:08:23,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:23,453 INFO L93 Difference]: Finished difference Result 107 states and 399 transitions. [2019-02-18 10:08:23,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:08:23,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 10:08:23,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:23,455 INFO L225 Difference]: With dead ends: 107 [2019-02-18 10:08:23,455 INFO L226 Difference]: Without dead ends: 106 [2019-02-18 10:08:23,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:08:23,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-18 10:08:23,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 74. [2019-02-18 10:08:23,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-18 10:08:23,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 337 transitions. [2019-02-18 10:08:23,563 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 337 transitions. Word has length 6 [2019-02-18 10:08:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:23,564 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 337 transitions. [2019-02-18 10:08:23,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:08:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 337 transitions. [2019-02-18 10:08:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:23,564 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:23,565 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:23,565 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:23,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:23,565 INFO L82 PathProgramCache]: Analyzing trace with hash 906534236, now seen corresponding path program 1 times [2019-02-18 10:08:23,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:23,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:23,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:23,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:23,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:23,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:23,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:23,697 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:23,697 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-02-18 10:08:23,698 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:23,698 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:23,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:23,907 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:23,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:23,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:23,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:23,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:23,916 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:23,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:23,926 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:23,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:23,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:23,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:23,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:08:23,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:23,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:23,977 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:23,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:08:23,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:23,985 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:23,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:23,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:23,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:08:23,987 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:24,014 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:24,026 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:24,037 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:24,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:24,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:08:24,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:08:24,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:08:24,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:08:24,166 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:24,178 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:24,192 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:24,208 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:24,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:24,236 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:08:24,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:08:24,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:24,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:24,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:08:24,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:24,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 10:08:24,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:24,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:24,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:25 [2019-02-18 10:08:24,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:24,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:24,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:24,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:24,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:08:24,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:24,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:08:24,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:08:24,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:08:24,394 INFO L87 Difference]: Start difference. First operand 74 states and 337 transitions. Second operand 8 states. [2019-02-18 10:08:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:24,780 INFO L93 Difference]: Finished difference Result 100 states and 371 transitions. [2019-02-18 10:08:24,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:08:24,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 10:08:24,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:24,782 INFO L225 Difference]: With dead ends: 100 [2019-02-18 10:08:24,782 INFO L226 Difference]: Without dead ends: 98 [2019-02-18 10:08:24,782 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:08:24,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-18 10:08:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 75. [2019-02-18 10:08:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-18 10:08:24,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 343 transitions. [2019-02-18 10:08:24,889 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 343 transitions. Word has length 6 [2019-02-18 10:08:24,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:24,890 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 343 transitions. [2019-02-18 10:08:24,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:08:24,890 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 343 transitions. [2019-02-18 10:08:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:24,890 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:24,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:24,890 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:24,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-02-18 10:08:24,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:24,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:24,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:24,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:25,032 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 16 [2019-02-18 10:08:25,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:25,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:25,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:25,049 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:25,049 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-02-18 10:08:25,050 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:25,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:25,706 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:25,707 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:08:25,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:25,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:25,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:25,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:25,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:25,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:25,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:25,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:25,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:08:25,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:25,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:25,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:08:25,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:25,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:25,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:25,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:25,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:08:25,827 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:25,839 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:25,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:25,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:25,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:08:25,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:25,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:25,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:08:25,880 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:25,898 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:25,911 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:25,922 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:25,932 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:25,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:25,954 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 10:08:25,982 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 10:08:26,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-02-18 10:08:26,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 11 dim-0 vars, and 5 xjuncts. [2019-02-18 10:08:26,176 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:231 [2019-02-18 10:08:26,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 65 [2019-02-18 10:08:26,275 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:26,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,354 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,357 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:26,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-18 10:08:26,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:26,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,428 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:26,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-02-18 10:08:26,429 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:26,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-18 10:08:26,484 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:158, output treesize:92 [2019-02-18 10:08:26,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,538 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 69 [2019-02-18 10:08:26,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:26,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,618 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:26,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-02-18 10:08:26,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:26,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:26,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 65 [2019-02-18 10:08:26,695 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:26,747 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-02-18 10:08:26,747 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:122, output treesize:84 [2019-02-18 10:08:26,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:26,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:26,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:26,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 10:08:26,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:26,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:08:26,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:08:26,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:08:26,928 INFO L87 Difference]: Start difference. First operand 75 states and 343 transitions. Second operand 10 states. [2019-02-18 10:08:27,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:27,843 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-02-18 10:08:27,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:08:27,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 10:08:27,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:27,845 INFO L225 Difference]: With dead ends: 124 [2019-02-18 10:08:27,845 INFO L226 Difference]: Without dead ends: 123 [2019-02-18 10:08:27,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:08:27,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-18 10:08:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2019-02-18 10:08:27,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-18 10:08:27,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 361 transitions. [2019-02-18 10:08:27,956 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 361 transitions. Word has length 6 [2019-02-18 10:08:27,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:27,956 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 361 transitions. [2019-02-18 10:08:27,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:08:27,956 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 361 transitions. [2019-02-18 10:08:27,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:27,956 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:27,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:27,956 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:27,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:27,957 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-02-18 10:08:27,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:27,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:27,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:27,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:27,957 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:28,117 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-02-18 10:08:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:28,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:28,136 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:28,136 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:28,136 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-02-18 10:08:28,138 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:28,139 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:28,849 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:28,849 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:08:28,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:28,850 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:28,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:28,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:28,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:28,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:28,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:28,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:28,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:08:28,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:08:28,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:28,903 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:28,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:28,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:28,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:28,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:28,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:28,922 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:28,925 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:28,927 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:28,929 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:28,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:08:28,929 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:28,967 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:28,986 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:29,001 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:29,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:29,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:08:29,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:08:29,110 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,112 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,113 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:08:29,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:08:29,163 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:29,179 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:29,195 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:29,210 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:29,240 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:29,240 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 10:08:29,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:08:29,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:29,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:29,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 10:08:29,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,332 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:29,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 10:08:29,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:29,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:29,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-18 10:08:29,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:29,396 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:29,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 10:08:29,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:29,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:29,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-02-18 10:08:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:29,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:29,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:29,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 10:08:29,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:29,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:08:29,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:08:29,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:08:29,540 INFO L87 Difference]: Start difference. First operand 78 states and 361 transitions. Second operand 9 states. [2019-02-18 10:08:30,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:30,114 INFO L93 Difference]: Finished difference Result 114 states and 434 transitions. [2019-02-18 10:08:30,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:08:30,115 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-18 10:08:30,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:30,116 INFO L225 Difference]: With dead ends: 114 [2019-02-18 10:08:30,116 INFO L226 Difference]: Without dead ends: 113 [2019-02-18 10:08:30,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:08:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-18 10:08:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 84. [2019-02-18 10:08:30,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-18 10:08:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 397 transitions. [2019-02-18 10:08:30,242 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 397 transitions. Word has length 6 [2019-02-18 10:08:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:30,242 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 397 transitions. [2019-02-18 10:08:30,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:08:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 397 transitions. [2019-02-18 10:08:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:30,242 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:30,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:30,242 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:30,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:30,243 INFO L82 PathProgramCache]: Analyzing trace with hash 906278546, now seen corresponding path program 2 times [2019-02-18 10:08:30,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:30,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:30,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:30,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:30,243 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:30,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:30,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:30,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:08:30,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:08:30,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:30,345 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:30,353 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:08:30,353 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:08:30,359 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:08:30,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:08:30,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:30,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:08:30,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:08:30,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:30,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:30,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:08:30,408 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:30,440 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:30,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:30,467 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:30,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:30,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:08:30,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:08:30,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:08:30,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:08:30,621 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:30,637 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:30,653 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:30,668 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:30,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:30,698 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:69, output treesize:66 [2019-02-18 10:08:30,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:08:30,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:30,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:30,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-02-18 10:08:30,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,770 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 10:08:30,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:30,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:30,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-18 10:08:30,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,832 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:30,838 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:30,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 10:08:30,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:30,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:30,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-02-18 10:08:30,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:30,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:30,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:30,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:08:30,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:30,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:08:30,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:08:30,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:08:30,938 INFO L87 Difference]: Start difference. First operand 84 states and 397 transitions. Second operand 10 states. [2019-02-18 10:08:31,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:31,504 INFO L93 Difference]: Finished difference Result 164 states and 664 transitions. [2019-02-18 10:08:31,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:08:31,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 10:08:31,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:31,507 INFO L225 Difference]: With dead ends: 164 [2019-02-18 10:08:31,507 INFO L226 Difference]: Without dead ends: 163 [2019-02-18 10:08:31,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:08:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-02-18 10:08:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 117. [2019-02-18 10:08:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-02-18 10:08:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 595 transitions. [2019-02-18 10:08:31,861 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 595 transitions. Word has length 6 [2019-02-18 10:08:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:31,861 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 595 transitions. [2019-02-18 10:08:31,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:08:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 595 transitions. [2019-02-18 10:08:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:31,862 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:31,862 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:31,862 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:31,863 INFO L82 PathProgramCache]: Analyzing trace with hash 906295908, now seen corresponding path program 1 times [2019-02-18 10:08:31,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:31,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:31,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:08:31,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:31,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:31,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:31,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:31,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:31,962 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-02-18 10:08:31,963 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:31,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:32,471 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:32,471 INFO L272 AbstractInterpreter]: Visited 6 different actions 12 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:32,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:32,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:32,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:32,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:32,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:32,481 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:32,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:32,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:32,493 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:08:32,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:08:32,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,563 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:08:32,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:08:32,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:32,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:32,638 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:32,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:32,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:32,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:32,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:08:32,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:08:32,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:08:32,691 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:32,712 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:32,725 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:32,735 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:32,745 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:32,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:32,772 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:08:32,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:08:32,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:32,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:32,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 10:08:32,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:32,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 10:08:32,862 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:08:32,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:32,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-18 10:08:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:32,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:33,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:33,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:08:33,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:33,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:08:33,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:08:33,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:08:33,034 INFO L87 Difference]: Start difference. First operand 117 states and 595 transitions. Second operand 8 states. [2019-02-18 10:08:33,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:33,533 INFO L93 Difference]: Finished difference Result 160 states and 722 transitions. [2019-02-18 10:08:33,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:08:33,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 10:08:33,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:33,536 INFO L225 Difference]: With dead ends: 160 [2019-02-18 10:08:33,536 INFO L226 Difference]: Without dead ends: 159 [2019-02-18 10:08:33,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:08:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-02-18 10:08:33,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 134. [2019-02-18 10:08:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-18 10:08:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 697 transitions. [2019-02-18 10:08:33,965 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 697 transitions. Word has length 6 [2019-02-18 10:08:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:33,965 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 697 transitions. [2019-02-18 10:08:33,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:08:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 697 transitions. [2019-02-18 10:08:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:33,966 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:33,966 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:33,967 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:33,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:33,967 INFO L82 PathProgramCache]: Analyzing trace with hash 893604942, now seen corresponding path program 1 times [2019-02-18 10:08:33,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:33,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:33,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:33,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:33,968 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:34,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:34,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:34,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:34,121 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:34,122 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-02-18 10:08:34,123 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:34,123 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:34,351 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:34,351 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:34,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:34,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:34,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:34,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:34,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:34,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:34,369 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:34,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:34,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:08:34,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,395 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:08:34,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 10:08:34,416 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:34,441 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:34,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:34,464 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:34,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:34,492 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:08:34,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:08:34,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,532 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,535 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:08:34,536 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:34,544 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:34,553 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:34,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:34,572 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-18 10:08:34,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 10:08:34,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:34,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:34,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 10:08:34,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:34,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-02-18 10:08:34,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:34,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:34,646 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2019-02-18 10:08:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:34,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:34,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:34,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:08:34,698 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:34,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:08:34,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:08:34,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:08:34,699 INFO L87 Difference]: Start difference. First operand 134 states and 697 transitions. Second operand 8 states. [2019-02-18 10:08:35,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:35,235 INFO L93 Difference]: Finished difference Result 175 states and 783 transitions. [2019-02-18 10:08:35,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:08:35,236 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 10:08:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:35,238 INFO L225 Difference]: With dead ends: 175 [2019-02-18 10:08:35,238 INFO L226 Difference]: Without dead ends: 174 [2019-02-18 10:08:35,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:08:35,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-02-18 10:08:35,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 132. [2019-02-18 10:08:35,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-18 10:08:35,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-02-18 10:08:35,476 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-02-18 10:08:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:35,476 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-02-18 10:08:35,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:08:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-02-18 10:08:35,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:35,477 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:35,477 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:35,477 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:35,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:35,478 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-02-18 10:08:35,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:35,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:35,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:35,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:35,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:08:35,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:08:35,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 10:08:35,576 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:08:35,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 10:08:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 10:08:35,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-18 10:08:35,576 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 5 states. [2019-02-18 10:08:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:35,933 INFO L93 Difference]: Finished difference Result 185 states and 858 transitions. [2019-02-18 10:08:35,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:08:35,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-02-18 10:08:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:35,935 INFO L225 Difference]: With dead ends: 185 [2019-02-18 10:08:35,935 INFO L226 Difference]: Without dead ends: 184 [2019-02-18 10:08:35,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-18 10:08:35,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-02-18 10:08:36,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2019-02-18 10:08:36,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-18 10:08:36,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 685 transitions. [2019-02-18 10:08:36,180 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 685 transitions. Word has length 6 [2019-02-18 10:08:36,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:36,181 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 685 transitions. [2019-02-18 10:08:36,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 10:08:36,181 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 685 transitions. [2019-02-18 10:08:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:36,181 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:36,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:36,182 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:36,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:36,182 INFO L82 PathProgramCache]: Analyzing trace with hash 897299026, now seen corresponding path program 1 times [2019-02-18 10:08:36,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:36,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:36,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:36,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:36,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:36,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:36,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:36,231 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:36,231 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:36,231 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-02-18 10:08:36,232 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:36,232 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:36,428 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:36,428 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:36,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:36,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:36,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:36,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:36,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:36,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:36,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:36,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:36,443 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:08:36,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:36,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:36,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:08:36,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:36,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:36,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:36,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:36,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:08:36,511 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:36,524 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:36,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:36,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:36,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:36,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:08:36,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:08:36,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 10:08:36,560 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:36,575 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:36,587 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:36,597 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:36,606 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:36,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:36,625 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-18 10:08:36,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:36,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2019-02-18 10:08:36,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:36,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:36,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:20 [2019-02-18 10:08:36,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:36,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:36,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:36,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:36,684 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:36,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 41 [2019-02-18 10:08:36,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:36,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:36,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-02-18 10:08:36,709 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:36,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:36,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:36,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:08:36,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:36,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:08:36,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:08:36,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:08:36,749 INFO L87 Difference]: Start difference. First operand 132 states and 685 transitions. Second operand 8 states. [2019-02-18 10:08:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:37,226 INFO L93 Difference]: Finished difference Result 142 states and 698 transitions. [2019-02-18 10:08:37,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:08:37,226 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 10:08:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:37,229 INFO L225 Difference]: With dead ends: 142 [2019-02-18 10:08:37,229 INFO L226 Difference]: Without dead ends: 141 [2019-02-18 10:08:37,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:08:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-02-18 10:08:37,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2019-02-18 10:08:37,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-18 10:08:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 682 transitions. [2019-02-18 10:08:37,463 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 682 transitions. Word has length 6 [2019-02-18 10:08:37,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:37,463 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 682 transitions. [2019-02-18 10:08:37,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:08:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 682 transitions. [2019-02-18 10:08:37,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:37,464 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:37,464 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-18 10:08:37,464 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:37,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:37,465 INFO L82 PathProgramCache]: Analyzing trace with hash 897354700, now seen corresponding path program 1 times [2019-02-18 10:08:37,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:37,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:37,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:37,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:37,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:37,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:37,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:37,571 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:37,571 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-02-18 10:08:37,571 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:37,571 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:38,099 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:38,099 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:38,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:38,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:38,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:38,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:38,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:38,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:38,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:38,121 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:38,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:38,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:08:38,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:08:38,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,160 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:08:38,163 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:38,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:38,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:38,218 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:38,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:38,246 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:08:38,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:08:38,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:08:38,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:08:38,341 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:38,354 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:38,368 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:38,383 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:38,408 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:38,408 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-18 10:08:38,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:08:38,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:08:38,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:38,527 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-18 10:08:38,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 10:08:38,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:38,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:38,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2019-02-18 10:08:38,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,605 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,610 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,611 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:38,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-18 10:08:38,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:38,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:38,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:08:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:38,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:38,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:38,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-02-18 10:08:38,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:38,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:08:38,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:08:38,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:08:38,697 INFO L87 Difference]: Start difference. First operand 130 states and 682 transitions. Second operand 9 states. [2019-02-18 10:08:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:39,383 INFO L93 Difference]: Finished difference Result 219 states and 1011 transitions. [2019-02-18 10:08:39,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:08:39,383 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-02-18 10:08:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:39,386 INFO L225 Difference]: With dead ends: 219 [2019-02-18 10:08:39,386 INFO L226 Difference]: Without dead ends: 216 [2019-02-18 10:08:39,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:08:39,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-02-18 10:08:39,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 148. [2019-02-18 10:08:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-02-18 10:08:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 790 transitions. [2019-02-18 10:08:39,693 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 790 transitions. Word has length 6 [2019-02-18 10:08:39,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:39,693 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 790 transitions. [2019-02-18 10:08:39,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:08:39,693 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 790 transitions. [2019-02-18 10:08:39,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:39,694 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:39,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:39,694 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:39,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:39,694 INFO L82 PathProgramCache]: Analyzing trace with hash 896937626, now seen corresponding path program 3 times [2019-02-18 10:08:39,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:39,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:39,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:39,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:39,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:39,771 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:39,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:39,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:39,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:08:39,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:08:39,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:39,772 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:39,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:08:39,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:08:39,785 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:08:39,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:08:39,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:39,804 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:39,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:08:39,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:39,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:39,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:08:39,859 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:39,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:39,862 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:39,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:39,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:08:39,864 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:39,874 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:39,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:39,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:39,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:08:39,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:39,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:39,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:08:39,909 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:39,927 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:39,940 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:39,950 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:39,959 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:39,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:39,980 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:52, output treesize:50 [2019-02-18 10:08:40,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-02-18 10:08:40,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:08:40,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:40,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:75 [2019-02-18 10:08:40,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,157 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 80 [2019-02-18 10:08:40,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:08:40,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-02-18 10:08:40,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:40,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-02-18 10:08:40,355 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:99, output treesize:90 [2019-02-18 10:08:40,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,420 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:40,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 88 [2019-02-18 10:08:40,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 4 xjuncts. [2019-02-18 10:08:40,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,615 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,619 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:40,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-02-18 10:08:40,621 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:40,711 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,713 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,714 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,715 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,716 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:40,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 79 [2019-02-18 10:08:40,723 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:40,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 3 dim-1 vars, End of recursive call: 16 dim-0 vars, and 5 xjuncts. [2019-02-18 10:08:40,813 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 13 variables, input treesize:117, output treesize:151 [2019-02-18 10:08:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:40,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:40,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:40,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:40,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 10:08:40,975 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:40,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:08:40,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:08:40,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:08:40,976 INFO L87 Difference]: Start difference. First operand 148 states and 790 transitions. Second operand 10 states. [2019-02-18 10:08:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:42,119 INFO L93 Difference]: Finished difference Result 218 states and 1012 transitions. [2019-02-18 10:08:42,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:08:42,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 10:08:42,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:42,122 INFO L225 Difference]: With dead ends: 218 [2019-02-18 10:08:42,123 INFO L226 Difference]: Without dead ends: 215 [2019-02-18 10:08:42,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2019-02-18 10:08:42,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-18 10:08:42,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 165. [2019-02-18 10:08:42,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2019-02-18 10:08:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 892 transitions. [2019-02-18 10:08:42,496 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 892 transitions. Word has length 6 [2019-02-18 10:08:42,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:42,496 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 892 transitions. [2019-02-18 10:08:42,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:08:42,496 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 892 transitions. [2019-02-18 10:08:42,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:42,497 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:42,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:42,497 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:42,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:42,497 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 1 times [2019-02-18 10:08:42,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:42,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:08:42,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:42,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:42,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:42,551 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:42,551 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:42,552 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-02-18 10:08:42,553 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:42,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:42,938 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:42,938 INFO L272 AbstractInterpreter]: Visited 6 different actions 9 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:42,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:42,939 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:42,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:42,939 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:42,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:42,948 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:42,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:42,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:42,958 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:08:42,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:42,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:42,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:08:43,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:08:43,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,078 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:08:43,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:43,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:43,113 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:43,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:43,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:43,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:43,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:08:43,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:08:43,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:08:43,171 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:43,257 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:43,269 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:43,280 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:43,290 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:43,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:43,320 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-18 10:08:43,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:08:43,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:43,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:43,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 10:08:43,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,394 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,396 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,397 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,398 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,399 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:43,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-02-18 10:08:43,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:43,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:43,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-02-18 10:08:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:43,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:43,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:43,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:08:43,507 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:43,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:08:43,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:08:43,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:08:43,508 INFO L87 Difference]: Start difference. First operand 165 states and 892 transitions. Second operand 8 states. [2019-02-18 10:08:44,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:44,339 INFO L93 Difference]: Finished difference Result 274 states and 1371 transitions. [2019-02-18 10:08:44,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:08:44,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-02-18 10:08:44,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:44,342 INFO L225 Difference]: With dead ends: 274 [2019-02-18 10:08:44,342 INFO L226 Difference]: Without dead ends: 269 [2019-02-18 10:08:44,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:08:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-02-18 10:08:44,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 221. [2019-02-18 10:08:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-02-18 10:08:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1227 transitions. [2019-02-18 10:08:44,829 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1227 transitions. Word has length 6 [2019-02-18 10:08:44,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:44,829 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1227 transitions. [2019-02-18 10:08:44,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:08:44,829 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1227 transitions. [2019-02-18 10:08:44,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-18 10:08:44,830 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:44,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-18 10:08:44,831 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:44,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:44,831 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 1 times [2019-02-18 10:08:44,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:44,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:44,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:44,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:44,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:44,986 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2019-02-18 10:08:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:45,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:45,038 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:45,038 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-18 10:08:45,038 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-02-18 10:08:45,039 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:45,039 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:46,168 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:46,168 INFO L272 AbstractInterpreter]: Visited 6 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:08:46,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:46,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:46,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:46,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:46,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:46,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:46,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:46,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:46,226 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:46,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:46,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:08:46,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:08:46,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:08:46,282 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:46,306 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:46,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:46,330 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:46,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:46,362 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:08:46,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:08:46,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:08:46,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,458 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:08:46,464 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:46,477 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:46,492 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:46,508 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:46,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:46,537 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:08:46,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:08:46,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:46,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:46,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 10:08:46,612 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,617 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,618 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,619 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 10:08:46,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:08:46,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:08:46,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-02-18 10:08:46,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:46,787 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:46,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 83 [2019-02-18 10:08:46,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:46,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:46,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-02-18 10:08:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:46,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:46,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:46,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:46,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-02-18 10:08:46,865 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:46,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:08:46,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:08:46,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:08:46,865 INFO L87 Difference]: Start difference. First operand 221 states and 1227 transitions. Second operand 10 states. [2019-02-18 10:08:48,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:48,473 INFO L93 Difference]: Finished difference Result 480 states and 2479 transitions. [2019-02-18 10:08:48,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 10:08:48,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-02-18 10:08:48,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:48,480 INFO L225 Difference]: With dead ends: 480 [2019-02-18 10:08:48,480 INFO L226 Difference]: Without dead ends: 477 [2019-02-18 10:08:48,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:08:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-02-18 10:08:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 348. [2019-02-18 10:08:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-02-18 10:08:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 1989 transitions. [2019-02-18 10:08:49,330 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 1989 transitions. Word has length 6 [2019-02-18 10:08:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:49,330 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 1989 transitions. [2019-02-18 10:08:49,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:08:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 1989 transitions. [2019-02-18 10:08:49,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:08:49,332 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:49,332 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-18 10:08:49,332 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:49,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:49,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2019467998, now seen corresponding path program 1 times [2019-02-18 10:08:49,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:49,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:49,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:49,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:49,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:49,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:49,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:49,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:49,378 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:08:49,378 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [28], [29] [2019-02-18 10:08:49,379 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:49,379 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:49,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:49,564 INFO L272 AbstractInterpreter]: Visited 6 different actions 8 times. Merged at 1 different actions 1 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:08:49,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:49,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:49,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:49,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:49,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:49,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:49,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:49,586 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:08:49,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:08:49,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-18 10:08:49,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-18 10:08:49,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-18 10:08:49,643 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:49,654 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:49,664 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:49,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:49,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:49,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:49,694 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-18 10:08:49,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:49,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-18 10:08:49,700 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:49,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:49,701 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-18 10:08:49,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:49,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 5 [2019-02-18 10:08:49,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:49,708 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:49,708 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:5 [2019-02-18 10:08:49,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:49,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:49,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:49,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 10:08:49,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 6 [2019-02-18 10:08:49,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:08:49,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 10:08:49,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 10:08:49,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:08:49,739 INFO L87 Difference]: Start difference. First operand 348 states and 1989 transitions. Second operand 5 states. [2019-02-18 10:08:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:51,693 INFO L93 Difference]: Finished difference Result 804 states and 4563 transitions. [2019-02-18 10:08:51,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:08:51,693 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-02-18 10:08:51,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:51,700 INFO L225 Difference]: With dead ends: 804 [2019-02-18 10:08:51,700 INFO L226 Difference]: Without dead ends: 800 [2019-02-18 10:08:51,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-02-18 10:08:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2019-02-18 10:08:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 774. [2019-02-18 10:08:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2019-02-18 10:08:53,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 4522 transitions. [2019-02-18 10:08:53,772 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 4522 transitions. Word has length 7 [2019-02-18 10:08:53,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:53,772 INFO L480 AbstractCegarLoop]: Abstraction has 774 states and 4522 transitions. [2019-02-18 10:08:53,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 10:08:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 4522 transitions. [2019-02-18 10:08:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:08:53,775 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:53,775 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:08:53,775 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:53,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:53,776 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-02-18 10:08:53,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:53,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:53,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:53,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:53,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:53,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:53,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:08:53,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:53,896 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:53,896 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:08:53,896 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-02-18 10:08:53,897 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:53,897 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:54,247 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:54,248 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:08:54,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:54,248 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:54,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:54,248 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:08:54,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:54,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:08:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:54,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:08:54,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:08:54,288 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:08:54,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:08:54,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:08:54,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,314 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,316 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:08:54,316 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,353 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,428 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:08:54,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:08:54,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:08:54,597 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:08:54,603 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,620 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,635 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,652 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,682 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-18 10:08:54,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 10:08:54,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:54,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-18 10:08:54,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-18 10:08:54,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:54,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-18 10:08:54,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,854 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:54,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-18 10:08:54,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:54,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:54,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-18 10:08:54,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,966 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:08:54,967 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:08:54,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 10:08:54,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:08:55,002 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:08:55,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-18 10:08:55,029 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:55,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:08:55,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:55,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:08:55,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 10:08:55,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:08:55,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:08:55,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:08:55,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:08:55,112 INFO L87 Difference]: Start difference. First operand 774 states and 4522 transitions. Second operand 12 states. [2019-02-18 10:08:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:08:57,788 INFO L93 Difference]: Finished difference Result 821 states and 4651 transitions. [2019-02-18 10:08:57,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:08:57,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 10:08:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:08:57,795 INFO L225 Difference]: With dead ends: 821 [2019-02-18 10:08:57,795 INFO L226 Difference]: Without dead ends: 820 [2019-02-18 10:08:57,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-02-18 10:08:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-02-18 10:08:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 736. [2019-02-18 10:08:59,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-02-18 10:08:59,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 4294 transitions. [2019-02-18 10:08:59,732 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 4294 transitions. Word has length 7 [2019-02-18 10:08:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:08:59,732 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 4294 transitions. [2019-02-18 10:08:59,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:08:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 4294 transitions. [2019-02-18 10:08:59,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:08:59,735 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:08:59,735 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:08:59,735 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:08:59,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:59,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-02-18 10:08:59,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:08:59,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:59,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:08:59,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:08:59,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:08:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:08:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:08:59,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:59,777 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:08:59,778 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:08:59,778 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-02-18 10:08:59,779 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:08:59,779 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:08:59,994 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:08:59,995 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:08:59,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:08:59,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:08:59,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:08:59,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:09:00,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:00,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:09:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:00,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:09:00,012 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-18 10:09:00,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-18 10:09:00,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-02-18 10:09:00,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:00,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:00,045 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:00,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:00,053 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-02-18 10:09:00,054 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:00,066 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:00,076 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:00,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:00,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:09:00,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:09:00,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-18 10:09:00,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-18 10:09:00,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:09:00,131 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:00,145 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:00,155 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:00,165 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:00,175 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:00,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:00,192 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:36, output treesize:42 [2019-02-18 10:09:00,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:00,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2019-02-18 10:09:00,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:00,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:00,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:11 [2019-02-18 10:09:00,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:00,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:00,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:00,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:00,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-02-18 10:09:00,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:00,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:00,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:13 [2019-02-18 10:09:00,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:00,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:09:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:00,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:09:00,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:09:00,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:09:00,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:09:00,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:09:00,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:09:00,292 INFO L87 Difference]: Start difference. First operand 736 states and 4294 transitions. Second operand 8 states. [2019-02-18 10:09:02,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:09:02,383 INFO L93 Difference]: Finished difference Result 805 states and 4572 transitions. [2019-02-18 10:09:02,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:09:02,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 10:09:02,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:09:02,390 INFO L225 Difference]: With dead ends: 805 [2019-02-18 10:09:02,390 INFO L226 Difference]: Without dead ends: 804 [2019-02-18 10:09:02,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:09:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2019-02-18 10:09:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 776. [2019-02-18 10:09:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-02-18 10:09:04,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 4534 transitions. [2019-02-18 10:09:04,468 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 4534 transitions. Word has length 7 [2019-02-18 10:09:04,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:09:04,468 INFO L480 AbstractCegarLoop]: Abstraction has 776 states and 4534 transitions. [2019-02-18 10:09:04,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:09:04,468 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 4534 transitions. [2019-02-18 10:09:04,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:09:04,469 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:09:04,470 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:09:04,470 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:09:04,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:04,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2018040016, now seen corresponding path program 1 times [2019-02-18 10:09:04,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:09:04,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:04,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:04,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:04,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:09:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:04,633 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:09:04,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:04,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:09:04,634 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:09:04,634 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-02-18 10:09:04,635 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:09:04,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:09:04,913 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:09:04,913 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:09:04,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:04,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:09:04,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:04,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:09:04,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:04,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:09:04,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:04,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:09:04,935 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:09:04,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:09:04,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:04,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:04,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:09:04,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:04,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:04,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:04,962 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:09:04,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:04,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:04,974 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:04,976 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:04,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:09:04,977 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:05,015 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:05,030 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:05,041 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:05,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:05,072 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:09:05,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:09:05,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,125 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,126 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:09:05,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:09:05,175 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:05,190 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:05,205 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:05,221 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:05,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:05,249 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:09:05,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:09:05,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:05,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:05,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:09:05,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 10:09:05,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:05,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:05,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:09:05,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,392 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:09:05,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:05,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 72 [2019-02-18 10:09:05,394 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:05,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:05,417 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 10:09:05,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:05,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:09:05,496 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:05,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:09:05,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:09:05,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:09:05,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:09:05,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:09:05,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:09:05,516 INFO L87 Difference]: Start difference. First operand 776 states and 4534 transitions. Second operand 10 states. [2019-02-18 10:09:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:09:08,400 INFO L93 Difference]: Finished difference Result 1004 states and 5711 transitions. [2019-02-18 10:09:08,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:09:08,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 10:09:08,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:09:08,410 INFO L225 Difference]: With dead ends: 1004 [2019-02-18 10:09:08,410 INFO L226 Difference]: Without dead ends: 1003 [2019-02-18 10:09:08,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:09:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2019-02-18 10:09:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 847. [2019-02-18 10:09:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2019-02-18 10:09:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 4961 transitions. [2019-02-18 10:09:10,615 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 4961 transitions. Word has length 7 [2019-02-18 10:09:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:09:10,615 INFO L480 AbstractCegarLoop]: Abstraction has 847 states and 4961 transitions. [2019-02-18 10:09:10,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:09:10,616 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 4961 transitions. [2019-02-18 10:09:10,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:09:10,618 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:09:10,618 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:09:10,618 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:09:10,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:10,618 INFO L82 PathProgramCache]: Analyzing trace with hash -2030550250, now seen corresponding path program 1 times [2019-02-18 10:09:10,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:09:10,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:10,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:10,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:10,619 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:09:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:10,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:10,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:10,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:09:10,715 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:09:10,715 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-02-18 10:09:10,716 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:09:10,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:09:10,928 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:09:10,929 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:09:10,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:10,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:09:10,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:10,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:09:10,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:10,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:09:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:10,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:09:10,951 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:09:10,968 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:10,972 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:10,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:09:11,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:11,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:11,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:11,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:11,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:09:11,017 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:11,025 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:11,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:11,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:09:11,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:09:11,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:09:11,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:09:11,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 10:09:11,065 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:11,080 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:11,091 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:11,101 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:11,112 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:11,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:11,133 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:44, output treesize:46 [2019-02-18 10:09:11,162 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:11,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 41 [2019-02-18 10:09:11,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:11,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:11,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:29 [2019-02-18 10:09:11,197 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:11,198 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:11,200 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:11,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:11,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:11,205 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:11,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 10:09:11,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:09:11,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:09:11,274 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:46 [2019-02-18 10:09:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:11,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:09:11,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:11,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:09:11,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-02-18 10:09:11,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:09:11,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:09:11,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:09:11,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:09:11,374 INFO L87 Difference]: Start difference. First operand 847 states and 4961 transitions. Second operand 9 states. [2019-02-18 10:09:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:09:14,698 INFO L93 Difference]: Finished difference Result 1213 states and 6892 transitions. [2019-02-18 10:09:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:09:14,699 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-18 10:09:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:09:14,707 INFO L225 Difference]: With dead ends: 1213 [2019-02-18 10:09:14,708 INFO L226 Difference]: Without dead ends: 1212 [2019-02-18 10:09:14,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:09:14,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-02-18 10:09:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1101. [2019-02-18 10:09:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-02-18 10:09:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 6484 transitions. [2019-02-18 10:09:17,612 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 6484 transitions. Word has length 7 [2019-02-18 10:09:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:09:17,612 INFO L480 AbstractCegarLoop]: Abstraction has 1101 states and 6484 transitions. [2019-02-18 10:09:17,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:09:17,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 6484 transitions. [2019-02-18 10:09:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:09:17,614 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:09:17,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:09:17,615 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:09:17,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:17,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 1 times [2019-02-18 10:09:17,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:09:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:17,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:17,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:17,616 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:09:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:17,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:17,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:09:17,746 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:09:17,746 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-02-18 10:09:17,747 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:09:17,747 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:09:18,097 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:09:18,097 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:09:18,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:18,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:09:18,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:18,098 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:09:18,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:18,106 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:09:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:18,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:09:18,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:09:18,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:09:18,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:09:18,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:09:18,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,172 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,174 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:09:18,175 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,221 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,234 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:09:18,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:09:18,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:09:18,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,391 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,394 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:09:18,394 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,411 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,427 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,444 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:18,475 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 10:09:18,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 10:09:18,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:18,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 10:09:18,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,568 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:09:18,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-02-18 10:09:18,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:18,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:42 [2019-02-18 10:09:18,624 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,626 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,628 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 82 [2019-02-18 10:09:18,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:18,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:38 [2019-02-18 10:09:18,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:18,704 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:09:18,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-18 10:09:18,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:18,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:18,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-02-18 10:09:18,762 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:18,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:09:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:18,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:09:18,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 10:09:18,831 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:09:18,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:09:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:09:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:09:18,831 INFO L87 Difference]: Start difference. First operand 1101 states and 6484 transitions. Second operand 12 states. [2019-02-18 10:09:23,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:09:23,291 INFO L93 Difference]: Finished difference Result 1577 states and 9103 transitions. [2019-02-18 10:09:23,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 10:09:23,291 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 10:09:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:09:23,306 INFO L225 Difference]: With dead ends: 1577 [2019-02-18 10:09:23,307 INFO L226 Difference]: Without dead ends: 1575 [2019-02-18 10:09:23,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=191, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:09:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2019-02-18 10:09:25,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 754. [2019-02-18 10:09:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-02-18 10:09:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 4401 transitions. [2019-02-18 10:09:25,349 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 4401 transitions. Word has length 7 [2019-02-18 10:09:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:09:25,349 INFO L480 AbstractCegarLoop]: Abstraction has 754 states and 4401 transitions. [2019-02-18 10:09:25,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:09:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 4401 transitions. [2019-02-18 10:09:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:09:25,351 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:09:25,351 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:09:25,351 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:09:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 1 times [2019-02-18 10:09:25,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:09:25,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:25,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:25,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:25,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:09:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:09:25,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:25,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:09:25,443 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:09:25,443 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-02-18 10:09:25,444 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:09:25,445 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:09:25,793 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:09:25,793 INFO L272 AbstractInterpreter]: Visited 7 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:09:25,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:25,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:09:25,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:25,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:09:25,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:25,802 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:09:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:25,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:09:25,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:09:25,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:09:25,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:25,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:25,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:09:25,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:25,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:25,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:25,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:09:25,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:09:25,860 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:25,890 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:25,906 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:25,915 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:25,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:25,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:25,947 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:09:25,973 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:25,975 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:25,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:09:26,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:09:26,008 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:26,018 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:26,027 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:26,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:26,049 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-18 10:09:26,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:09:26,091 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:26,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:26,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:09:26,128 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,131 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:09:26,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-02-18 10:09:26,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:26,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:26,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-02-18 10:09:26,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,178 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,180 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,181 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,182 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-18 10:09:26,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:26,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:26,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-18 10:09:26,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:26,231 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:09:26,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-18 10:09:26,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:26,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:26,255 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-18 10:09:26,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:26,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:09:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:26,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:09:26,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-18 10:09:26,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:09:26,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:09:26,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:09:26,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:09:26,344 INFO L87 Difference]: Start difference. First operand 754 states and 4401 transitions. Second operand 11 states. [2019-02-18 10:09:31,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:09:31,421 INFO L93 Difference]: Finished difference Result 1108 states and 6316 transitions. [2019-02-18 10:09:31,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:09:31,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 10:09:31,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:09:31,428 INFO L225 Difference]: With dead ends: 1108 [2019-02-18 10:09:31,428 INFO L226 Difference]: Without dead ends: 1107 [2019-02-18 10:09:31,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=194, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:09:31,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-02-18 10:09:34,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 1052. [2019-02-18 10:09:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-02-18 10:09:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 6189 transitions. [2019-02-18 10:09:34,386 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 6189 transitions. Word has length 7 [2019-02-18 10:09:34,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:09:34,386 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 6189 transitions. [2019-02-18 10:09:34,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:09:34,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 6189 transitions. [2019-02-18 10:09:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:09:34,389 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:09:34,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:09:34,389 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:09:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:34,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1973291948, now seen corresponding path program 1 times [2019-02-18 10:09:34,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:09:34,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:34,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:34,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:34,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:09:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:34,536 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-02-18 10:09:34,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:09:34,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:34,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:09:34,565 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:09:34,565 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-02-18 10:09:34,566 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:09:34,566 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:09:35,103 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:09:35,104 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:09:35,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:35,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:09:35,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:35,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:09:35,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:35,112 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:09:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:35,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:09:35,123 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:09:35,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:09:35,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:09:35,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:09:35,159 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:09:35,170 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:35,208 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:35,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:35,243 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:35,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:35,280 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:09:35,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:09:35,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,355 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,359 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:09:35,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:09:35,450 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:35,465 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:35,480 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:35,496 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:35,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:35,526 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:09:35,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:09:35,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:35,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:35,583 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 10:09:35,606 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,608 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,609 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,613 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:35,614 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:09:35,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 10:09:35,625 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:09:35,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:09:35,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-18 10:09:35,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:35,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:09:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:35,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:09:35,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:09:35,802 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:09:35,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:09:35,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:09:35,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:09:35,803 INFO L87 Difference]: Start difference. First operand 1052 states and 6189 transitions. Second operand 8 states. [2019-02-18 10:09:38,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:09:38,820 INFO L93 Difference]: Finished difference Result 1075 states and 6230 transitions. [2019-02-18 10:09:38,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:09:38,820 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 10:09:38,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:09:38,824 INFO L225 Difference]: With dead ends: 1075 [2019-02-18 10:09:38,825 INFO L226 Difference]: Without dead ends: 1074 [2019-02-18 10:09:38,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:09:38,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2019-02-18 10:09:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 1054. [2019-02-18 10:09:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-02-18 10:09:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 6201 transitions. [2019-02-18 10:09:41,694 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 6201 transitions. Word has length 7 [2019-02-18 10:09:41,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:09:41,695 INFO L480 AbstractCegarLoop]: Abstraction has 1054 states and 6201 transitions. [2019-02-18 10:09:41,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:09:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 6201 transitions. [2019-02-18 10:09:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:09:41,696 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:09:41,696 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:09:41,697 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:09:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1973720682, now seen corresponding path program 1 times [2019-02-18 10:09:41,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:09:41,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:41,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:41,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:41,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:09:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:09:41,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:41,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:09:41,780 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:09:41,780 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-02-18 10:09:41,781 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:09:41,781 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:09:42,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:09:42,478 INFO L272 AbstractInterpreter]: Visited 7 different actions 17 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:09:42,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:42,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:09:42,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:42,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:09:42,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:42,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:09:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:42,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:09:42,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 18 treesize of output 21 [2019-02-18 10:09:42,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 21 treesize of output 27 [2019-02-18 10:09:42,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:09:42,539 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:09:42,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:09:42,557 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:42,587 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:42,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:42,614 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:42,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:42,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:09:42,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:09:42,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:09:42,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,771 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,773 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,774 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,775 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:09:42,776 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:42,793 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:42,809 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:42,826 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:42,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:42,858 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 10:09:42,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:09:42,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:42,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:42,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 10:09:42,984 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:42,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,020 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,105 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:09:43,106 INFO L303 Elim1Store]: Index analysis took 162 ms [2019-02-18 10:09:43,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 10:09:43,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:43,139 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:43,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-02-18 10:09:43,163 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,164 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,165 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,166 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,168 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,169 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,170 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 10:09:43,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:43,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:43,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-02-18 10:09:43,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,237 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,238 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,240 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:43,241 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:09:43,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 10:09:43,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:43,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:43,276 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-18 10:09:43,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:43,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:09:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:43,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:09:43,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 10:09:43,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:09:43,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:09:43,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:09:43,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:09:43,371 INFO L87 Difference]: Start difference. First operand 1054 states and 6201 transitions. Second operand 12 states. [2019-02-18 10:09:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:09:49,861 INFO L93 Difference]: Finished difference Result 1522 states and 8743 transitions. [2019-02-18 10:09:49,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:09:49,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 10:09:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:09:49,869 INFO L225 Difference]: With dead ends: 1522 [2019-02-18 10:09:49,869 INFO L226 Difference]: Without dead ends: 1521 [2019-02-18 10:09:49,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-02-18 10:09:49,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-02-18 10:09:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1125. [2019-02-18 10:09:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2019-02-18 10:09:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 6627 transitions. [2019-02-18 10:09:53,118 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 6627 transitions. Word has length 7 [2019-02-18 10:09:53,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:09:53,118 INFO L480 AbstractCegarLoop]: Abstraction has 1125 states and 6627 transitions. [2019-02-18 10:09:53,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:09:53,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 6627 transitions. [2019-02-18 10:09:53,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:09:53,120 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:09:53,120 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:09:53,120 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:09:53,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:53,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-02-18 10:09:53,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:09:53,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:53,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:53,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:09:53,122 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:09:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:53,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:53,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:53,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:09:53,158 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:09:53,159 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-02-18 10:09:53,159 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:09:53,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:09:54,463 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:09:54,463 INFO L272 AbstractInterpreter]: Visited 7 different actions 15 times. Merged at 1 different actions 4 times. Widened at 1 different actions 1 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2019-02-18 10:09:54,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:09:54,464 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:09:54,464 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:09:54,464 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:09:54,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:09:54,473 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:09:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:09:54,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:09:54,482 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:09:54,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:09:54,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-18 10:09:54,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-18 10:09:54,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-02-18 10:09:54,539 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:54,547 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:54,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:54,567 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:54,577 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:54,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:09:54,587 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-02-18 10:09:54,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:09:54,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-02-18 10:09:54,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:09:54,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:09:54,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-02-18 10:09:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:54,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:09:54,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:09:54,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-02-18 10:09:54,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-02-18 10:09:54,629 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:09:54,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 10:09:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 10:09:54,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 10:09:54,629 INFO L87 Difference]: Start difference. First operand 1125 states and 6627 transitions. Second operand 4 states. [2019-02-18 10:09:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:09:58,720 INFO L93 Difference]: Finished difference Result 1559 states and 9048 transitions. [2019-02-18 10:09:58,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 10:09:58,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-02-18 10:09:58,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:09:58,727 INFO L225 Difference]: With dead ends: 1559 [2019-02-18 10:09:58,728 INFO L226 Difference]: Without dead ends: 1554 [2019-02-18 10:09:58,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-02-18 10:09:58,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2019-02-18 10:10:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1528. [2019-02-18 10:10:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-02-18 10:10:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 8994 transitions. [2019-02-18 10:10:03,196 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 8994 transitions. Word has length 7 [2019-02-18 10:10:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:10:03,196 INFO L480 AbstractCegarLoop]: Abstraction has 1528 states and 8994 transitions. [2019-02-18 10:10:03,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 10:10:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 8994 transitions. [2019-02-18 10:10:03,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:10:03,200 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:10:03,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:10:03,200 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:10:03,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:10:03,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-02-18 10:10:03,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:10:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:10:03,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:10:03,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:10:03,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:10:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:10:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:10:03,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:10:03,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:10:03,318 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:10:03,319 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-02-18 10:10:03,320 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:10:03,320 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:10:03,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:10:03,832 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:10:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:10:03,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:10:03,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:10:03,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:10:03,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:10:03,841 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:10:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:10:03,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:10:03,852 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:10:03,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:10:03,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:03,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:03,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:10:03,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:03,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:03,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:03,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:10:03,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:03,897 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:03,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:03,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:03,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:10:03,902 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:03,931 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:03,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:03,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:03,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:03,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:10:04,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:10:04,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,043 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:10:04,091 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,092 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,093 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,094 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,098 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:10:04,099 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:04,115 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:04,129 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:04,146 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:04,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:04,174 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:10:04,201 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:10:04,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:04,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:04,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 10:10:04,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:04,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 10:10:04,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:10:04,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:10:04,378 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-18 10:10:06,149 WARN L181 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 51 DAG size of output: 26 [2019-02-18 10:10:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:10:06,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:10:06,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:10:06,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:10:06,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-02-18 10:10:06,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:10:06,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:10:06,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:10:06,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-02-18 10:10:06,190 INFO L87 Difference]: Start difference. First operand 1528 states and 8994 transitions. Second operand 8 states. [2019-02-18 10:10:10,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:10:10,674 INFO L93 Difference]: Finished difference Result 1574 states and 9156 transitions. [2019-02-18 10:10:10,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:10:10,674 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 10:10:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:10:10,681 INFO L225 Difference]: With dead ends: 1574 [2019-02-18 10:10:10,681 INFO L226 Difference]: Without dead ends: 1570 [2019-02-18 10:10:10,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:10:10,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2019-02-18 10:10:15,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1547. [2019-02-18 10:10:15,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1547 states. [2019-02-18 10:10:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 9102 transitions. [2019-02-18 10:10:15,211 INFO L78 Accepts]: Start accepts. Automaton has 1547 states and 9102 transitions. Word has length 7 [2019-02-18 10:10:15,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:10:15,211 INFO L480 AbstractCegarLoop]: Abstraction has 1547 states and 9102 transitions. [2019-02-18 10:10:15,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:10:15,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 9102 transitions. [2019-02-18 10:10:15,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:10:15,213 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:10:15,214 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-02-18 10:10:15,214 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:10:15,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:10:15,214 INFO L82 PathProgramCache]: Analyzing trace with hash -1969901668, now seen corresponding path program 2 times [2019-02-18 10:10:15,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:10:15,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:10:15,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:10:15,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:10:15,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:10:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:10:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:10:15,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:10:15,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:10:15,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:10:15,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:10:15,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:10:15,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:10:15,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:10:15,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:10:15,311 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:10:15,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:10:15,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:10:15,320 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:10:15,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:10:15,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:10:15,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:10:15,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:10:15,352 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:15,379 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:15,393 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:15,405 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:15,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:15,434 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:10:15,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:10:15,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:10:15,529 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,530 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,531 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,533 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,534 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,536 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:10:15,537 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:15,551 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:15,566 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:15,582 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:15,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:15,611 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:10:15,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:10:15,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:15,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:15,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-18 10:10:15,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,692 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 10:10:15,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:10:15,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:10:15,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-02-18 10:10:15,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,854 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,856 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,859 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:10:15,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 10:10:15,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:15,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:15,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:27 [2019-02-18 10:10:15,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,914 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,915 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,916 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:15,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 79 [2019-02-18 10:10:15,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:15,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:15,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-02-18 10:10:15,963 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:10:15,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:10:16,011 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:10:16,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:10:16,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 10:10:16,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:10:16,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:10:16,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:10:16,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:10:16,031 INFO L87 Difference]: Start difference. First operand 1547 states and 9102 transitions. Second operand 11 states. [2019-02-18 10:10:22,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:10:22,231 INFO L93 Difference]: Finished difference Result 2098 states and 12192 transitions. [2019-02-18 10:10:22,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:10:22,231 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 10:10:22,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:10:22,236 INFO L225 Difference]: With dead ends: 2098 [2019-02-18 10:10:22,237 INFO L226 Difference]: Without dead ends: 2091 [2019-02-18 10:10:22,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:10:22,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2019-02-18 10:10:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1838. [2019-02-18 10:10:27,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-02-18 10:10:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10847 transitions. [2019-02-18 10:10:27,551 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10847 transitions. Word has length 7 [2019-02-18 10:10:27,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:10:27,551 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10847 transitions. [2019-02-18 10:10:27,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:10:27,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10847 transitions. [2019-02-18 10:10:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:10:27,553 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:10:27,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:10:27,554 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:10:27,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:10:27,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1965903780, now seen corresponding path program 1 times [2019-02-18 10:10:27,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:10:27,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:10:27,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:10:27,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:10:27,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:10:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:10:27,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:10:27,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:10:27,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:10:27,605 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:10:27,605 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-02-18 10:10:27,606 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:10:27,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:10:28,110 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:10:28,110 INFO L272 AbstractInterpreter]: Visited 7 different actions 13 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:10:28,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:10:28,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:10:28,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:10:28,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:10:28,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:10:28,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:10:28,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:10:28,123 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:10:28,128 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:10:28,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:10:28,194 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:10:28,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:10:28,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:10:28,237 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:28,263 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:28,276 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:28,288 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:28,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:28,318 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:10:28,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:10:28,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:10:28,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:10:28,419 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:28,434 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:28,449 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:28,465 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:28,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:28,494 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:10:28,528 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:10:28,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:28,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:28,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-02-18 10:10:28,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,566 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,568 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:28,577 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:10:28,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 10:10:28,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:28,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:28,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-02-18 10:10:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:10:28,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:10:28,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:10:28,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:10:28,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:10:28,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:10:28,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:10:28,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:10:28,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:10:28,653 INFO L87 Difference]: Start difference. First operand 1838 states and 10847 transitions. Second operand 8 states. [2019-02-18 10:10:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:10:33,790 INFO L93 Difference]: Finished difference Result 1846 states and 10859 transitions. [2019-02-18 10:10:33,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:10:33,790 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 10:10:33,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:10:33,795 INFO L225 Difference]: With dead ends: 1846 [2019-02-18 10:10:33,795 INFO L226 Difference]: Without dead ends: 1839 [2019-02-18 10:10:33,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:10:33,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2019-02-18 10:10:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1838. [2019-02-18 10:10:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-02-18 10:10:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 10841 transitions. [2019-02-18 10:10:39,034 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 10841 transitions. Word has length 7 [2019-02-18 10:10:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:10:39,034 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 10841 transitions. [2019-02-18 10:10:39,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:10:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 10841 transitions. [2019-02-18 10:10:39,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:10:39,036 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:10:39,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:10:39,037 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:10:39,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:10:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash 1931530426, now seen corresponding path program 1 times [2019-02-18 10:10:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:10:39,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:10:39,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:10:39,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:10:39,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:10:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:10:39,464 WARN L181 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-02-18 10:10:39,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:10:39,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:10:39,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:10:39,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:10:39,537 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-02-18 10:10:39,538 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:10:39,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:10:39,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:10:39,815 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:10:39,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:10:39,815 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:10:39,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:10:39,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:10:39,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:10:39,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:10:39,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:10:39,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:10:39,837 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:10:39,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:10:39,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:39,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:39,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:10:39,866 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:39,868 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:39,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:39,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:10:39,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:39,883 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:39,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:39,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:39,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:10:39,889 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:39,919 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:39,932 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:39,942 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:39,954 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:39,976 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:10:39,989 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:39,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:39,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:10:40,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:10:40,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:10:40,088 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:40,104 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:40,119 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:40,136 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:40,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:40,166 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:10:40,199 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:10:40,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:10:40,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:10:40,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:96 [2019-02-18 10:10:40,404 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,405 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,406 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 61 [2019-02-18 10:10:40,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:40,471 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,472 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,473 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,475 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,476 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,477 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,478 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 78 [2019-02-18 10:10:40,480 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:40,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:10:40,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:64 [2019-02-18 10:10:40,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,585 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:10:40,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-02-18 10:10:40,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:40,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,650 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:10:40,651 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:40,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-02-18 10:10:40,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:40,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:10:40,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-18 10:10:40,767 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:10:40,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:10:40,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:10:40,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:10:40,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-18 10:10:40,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:10:40,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:10:40,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:10:40,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:10:40,860 INFO L87 Difference]: Start difference. First operand 1838 states and 10841 transitions. Second operand 11 states. [2019-02-18 10:10:42,800 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2019-02-18 10:10:47,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:10:47,870 INFO L93 Difference]: Finished difference Result 2193 states and 12710 transitions. [2019-02-18 10:10:47,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:10:47,871 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 10:10:47,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:10:47,876 INFO L225 Difference]: With dead ends: 2193 [2019-02-18 10:10:47,876 INFO L226 Difference]: Without dead ends: 2192 [2019-02-18 10:10:47,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2019-02-18 10:10:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2192 states. [2019-02-18 10:10:53,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2192 to 1949. [2019-02-18 10:10:53,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-02-18 10:10:53,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 11505 transitions. [2019-02-18 10:10:53,633 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 11505 transitions. Word has length 7 [2019-02-18 10:10:53,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:10:53,633 INFO L480 AbstractCegarLoop]: Abstraction has 1949 states and 11505 transitions. [2019-02-18 10:10:53,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:10:53,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 11505 transitions. [2019-02-18 10:10:53,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:10:53,636 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:10:53,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:10:53,636 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:10:53,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:10:53,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 2 times [2019-02-18 10:10:53,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:10:53,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:10:53,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:10:53,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:10:53,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:10:53,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:10:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:10:53,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:10:53,742 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:10:53,742 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:10:53,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:10:53,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:10:53,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:10:53,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:10:53,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:10:53,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:10:53,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:10:53,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:10:53,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:10:53,818 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,819 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:10:53,855 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:10:53,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:53,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:10:53,913 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:53,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:53,952 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:53,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:53,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:10:54,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:10:54,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:10:54,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:10:54,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:10:54,066 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:54,142 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:54,157 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:54,168 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:54,178 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:10:54,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:54,209 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 10:10:54,239 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:10:54,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:54,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:54,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 10:10:54,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,303 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 10:10:54,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:54,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:54,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-02-18 10:10:54,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,375 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:10:54,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 10:10:54,376 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:54,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:54,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-18 10:10:54,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,443 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,448 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,449 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,450 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:10:54,450 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:10:54,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-02-18 10:10:54,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:10:54,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:10:54,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-02-18 10:10:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:10:54,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:10:54,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:10:54,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:10:54,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 10:10:54,578 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:10:54,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:10:54,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:10:54,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:10:54,579 INFO L87 Difference]: Start difference. First operand 1949 states and 11505 transitions. Second operand 12 states. [2019-02-18 10:11:01,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:11:01,951 INFO L93 Difference]: Finished difference Result 2526 states and 14755 transitions. [2019-02-18 10:11:01,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:11:01,952 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-02-18 10:11:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:11:01,958 INFO L225 Difference]: With dead ends: 2526 [2019-02-18 10:11:01,958 INFO L226 Difference]: Without dead ends: 2520 [2019-02-18 10:11:01,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-02-18 10:11:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2019-02-18 10:11:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 1960. [2019-02-18 10:11:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1960 states. [2019-02-18 10:11:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1960 states to 1960 states and 11570 transitions. [2019-02-18 10:11:07,731 INFO L78 Accepts]: Start accepts. Automaton has 1960 states and 11570 transitions. Word has length 7 [2019-02-18 10:11:07,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:11:07,731 INFO L480 AbstractCegarLoop]: Abstraction has 1960 states and 11570 transitions. [2019-02-18 10:11:07,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:11:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1960 states and 11570 transitions. [2019-02-18 10:11:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:11:07,734 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:11:07,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:11:07,734 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:11:07,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:11:07,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1928255402, now seen corresponding path program 1 times [2019-02-18 10:11:07,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:11:07,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:11:07,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:11:07,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:11:07,735 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:11:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:11:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:11:07,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:11:07,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:11:07,822 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:11:07,823 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [26], [28], [29] [2019-02-18 10:11:07,823 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:11:07,824 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:11:08,307 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:11:08,307 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:11:08,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:11:08,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:11:08,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:11:08,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:11:08,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:11:08,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:11:08,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:11:08,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:11:08,325 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:11:08,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:11:08,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:11:08,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,353 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:11:08,356 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,361 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:11:08,367 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:08,401 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:08,414 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:08,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:08,433 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:08,453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:11:08,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,467 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:11:08,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:11:08,540 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:11:08,547 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:08,561 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:08,574 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:08,589 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:08,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:11:08,616 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:11:08,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:11:08,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:11:08,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:11:08,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:96 [2019-02-18 10:11:08,816 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:08,843 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:11:08,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 10:11:08,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:08,877 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:11:08,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:29 [2019-02-18 10:11:08,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:11:08,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:11:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:11:08,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:11:08,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2019-02-18 10:11:08,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:11:08,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:11:08,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:11:08,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:11:08,964 INFO L87 Difference]: Start difference. First operand 1960 states and 11570 transitions. Second operand 9 states. [2019-02-18 10:11:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:11:14,497 INFO L93 Difference]: Finished difference Result 1971 states and 11600 transitions. [2019-02-18 10:11:14,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:11:14,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-18 10:11:14,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:11:14,502 INFO L225 Difference]: With dead ends: 1971 [2019-02-18 10:11:14,502 INFO L226 Difference]: Without dead ends: 1964 [2019-02-18 10:11:14,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:11:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2019-02-18 10:11:20,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1964. [2019-02-18 10:11:20,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1964 states. [2019-02-18 10:11:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1964 states to 1964 states and 11590 transitions. [2019-02-18 10:11:20,286 INFO L78 Accepts]: Start accepts. Automaton has 1964 states and 11590 transitions. Word has length 7 [2019-02-18 10:11:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:11:20,286 INFO L480 AbstractCegarLoop]: Abstraction has 1964 states and 11590 transitions. [2019-02-18 10:11:20,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:11:20,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1964 states and 11590 transitions. [2019-02-18 10:11:20,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:11:20,290 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:11:20,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:11:20,290 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:11:20,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:11:20,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2048132400, now seen corresponding path program 2 times [2019-02-18 10:11:20,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:11:20,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:11:20,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:11:20,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:11:20,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:11:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:11:20,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:11:20,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:11:20,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:11:20,364 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:11:20,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:11:20,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:11:20,364 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:11:20,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:11:20,375 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:11:20,381 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:11:20,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:11:20,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:11:20,385 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:11:20,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:11:20,400 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,402 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:11:20,407 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:11:20,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:11:20,417 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:20,442 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:20,456 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:20,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:20,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:20,495 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:11:20,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:11:20,541 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,546 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:11:20,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:11:20,591 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:20,605 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:20,618 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:20,633 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:20,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:11:20,659 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:11:20,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:11:20,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:20,720 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:11:20,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:11:20,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 10:11:20,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:20,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:11:20,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:11:20,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,789 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:20,797 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:11:20,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-02-18 10:11:20,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:20,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:11:20,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:11:20,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:11:20,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:11:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:11:20,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:11:20,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 10:11:20,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:11:20,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:11:20,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:11:20,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:11:20,897 INFO L87 Difference]: Start difference. First operand 1964 states and 11590 transitions. Second operand 9 states. [2019-02-18 10:11:26,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:11:26,799 INFO L93 Difference]: Finished difference Result 2036 states and 11913 transitions. [2019-02-18 10:11:26,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:11:26,799 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-02-18 10:11:26,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:11:26,804 INFO L225 Difference]: With dead ends: 2036 [2019-02-18 10:11:26,804 INFO L226 Difference]: Without dead ends: 2033 [2019-02-18 10:11:26,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:11:26,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2033 states. [2019-02-18 10:11:32,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2033 to 2012. [2019-02-18 10:11:32,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2012 states. [2019-02-18 10:11:32,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2012 states to 2012 states and 11885 transitions. [2019-02-18 10:11:32,797 INFO L78 Accepts]: Start accepts. Automaton has 2012 states and 11885 transitions. Word has length 7 [2019-02-18 10:11:32,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:11:32,797 INFO L480 AbstractCegarLoop]: Abstraction has 2012 states and 11885 transitions. [2019-02-18 10:11:32,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:11:32,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2012 states and 11885 transitions. [2019-02-18 10:11:32,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:11:32,800 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:11:32,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:11:32,800 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:11:32,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:11:32,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2047765234, now seen corresponding path program 3 times [2019-02-18 10:11:32,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:11:32,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:11:32,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:11:32,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:11:32,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:11:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:11:32,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:11:32,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:11:32,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:11:32,908 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:11:32,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:11:32,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:11:32,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:11:32,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:11:32,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:11:32,922 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:11:32,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:11:32,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:11:32,940 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:32,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2019-02-18 10:11:32,965 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:32,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:32,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:11:32,996 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:32,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:32,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2019-02-18 10:11:33,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:33,012 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:33,023 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:33,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:11:33,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:11:33,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:11:33,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:11:33,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-02-18 10:11:33,074 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:33,091 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:33,104 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:33,114 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:33,123 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:33,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:11:33,143 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2019-02-18 10:11:33,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 60 [2019-02-18 10:11:33,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:11:33,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-02-18 10:11:33,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:60, output treesize:75 [2019-02-18 10:11:33,290 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 80 [2019-02-18 10:11:33,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-02-18 10:11:33,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,488 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:11:33,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-02-18 10:11:33,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:33,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 5 xjuncts. [2019-02-18 10:11:33,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:96, output treesize:167 [2019-02-18 10:11:33,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 57 [2019-02-18 10:11:33,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:33,945 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:33,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-18 10:11:33,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:34,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,043 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:11:34,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-18 10:11:34,044 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:34,116 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,117 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,118 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,119 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,120 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,122 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,122 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:11:34,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 71 [2019-02-18 10:11:34,124 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:34,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-02-18 10:11:34,189 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:167, output treesize:115 [2019-02-18 10:11:34,249 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,250 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,251 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,253 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:11:34,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2019-02-18 10:11:34,254 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:34,326 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,327 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-18 10:11:34,337 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:34,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,416 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:11:34,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 67 [2019-02-18 10:11:34,418 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:34,482 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,483 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,484 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,486 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:34,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 93 [2019-02-18 10:11:34,493 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:34,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-02-18 10:11:34,559 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:155, output treesize:111 [2019-02-18 10:11:35,084 WARN L181 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-02-18 10:11:35,087 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:11:35,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:11:35,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:11:35,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:11:35,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-02-18 10:11:35,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:11:35,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:11:35,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:11:35,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:11:35,225 INFO L87 Difference]: Start difference. First operand 2012 states and 11885 transitions. Second operand 11 states. [2019-02-18 10:11:37,373 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2019-02-18 10:11:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:11:44,575 INFO L93 Difference]: Finished difference Result 2952 states and 17243 transitions. [2019-02-18 10:11:44,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 10:11:44,576 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 10:11:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:11:44,583 INFO L225 Difference]: With dead ends: 2952 [2019-02-18 10:11:44,583 INFO L226 Difference]: Without dead ends: 2951 [2019-02-18 10:11:44,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-02-18 10:11:44,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2019-02-18 10:11:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 1726. [2019-02-18 10:11:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1726 states. [2019-02-18 10:11:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1726 states to 1726 states and 10171 transitions. [2019-02-18 10:11:49,951 INFO L78 Accepts]: Start accepts. Automaton has 1726 states and 10171 transitions. Word has length 7 [2019-02-18 10:11:49,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:11:49,951 INFO L480 AbstractCegarLoop]: Abstraction has 1726 states and 10171 transitions. [2019-02-18 10:11:49,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:11:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1726 states and 10171 transitions. [2019-02-18 10:11:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:11:49,953 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:11:49,953 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:11:49,953 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:11:49,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:11:49,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-02-18 10:11:49,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:11:49,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:11:49,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:11:49,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:11:49,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:11:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:11:50,091 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:11:50,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:11:50,092 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:11:50,092 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-02-18 10:11:50,092 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-02-18 10:11:50,093 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:11:50,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:11:50,286 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:11:50,287 INFO L272 AbstractInterpreter]: Visited 7 different actions 10 times. Merged at 1 different actions 1 times. Never widened. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:11:50,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:11:50,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:11:50,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:11:50,287 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:11:50,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:11:50,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:11:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:11:50,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:11:50,308 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:11:50,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:11:50,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:11:50,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:11:50,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:50,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:50,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:50,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:50,487 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:11:50,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:11:50,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:11:50,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:11:50,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:11:50,500 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:50,521 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:50,533 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:50,542 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:50,551 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:11:50,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:11:50,578 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:11:50,604 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:11:50,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:11:50,701 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:11:50,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-02-18 10:11:50,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,769 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,769 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:11:50,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2019-02-18 10:11:50,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:50,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,831 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:11:50,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-18 10:11:50,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:11:50,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:11:50,888 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:112, output treesize:86 [2019-02-18 10:11:50,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:11:50,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:11:51,000 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:11:51,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:11:51,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2019-02-18 10:11:51,018 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:11:51,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:11:51,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:11:51,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-02-18 10:11:51,019 INFO L87 Difference]: Start difference. First operand 1726 states and 10171 transitions. Second operand 10 states. [2019-02-18 10:11:51,243 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2019-02-18 10:12:01,436 WARN L181 SmtUtils]: Spent 10.18 s on a formula simplification. DAG size of input: 94 DAG size of output: 83 [2019-02-18 10:12:07,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:12:07,238 INFO L93 Difference]: Finished difference Result 1903 states and 11093 transitions. [2019-02-18 10:12:07,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:12:07,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-02-18 10:12:07,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:12:07,243 INFO L225 Difference]: With dead ends: 1903 [2019-02-18 10:12:07,243 INFO L226 Difference]: Without dead ends: 1896 [2019-02-18 10:12:07,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:12:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-02-18 10:12:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1875. [2019-02-18 10:12:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-02-18 10:12:13,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 11063 transitions. [2019-02-18 10:12:13,204 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 11063 transitions. Word has length 7 [2019-02-18 10:12:13,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:12:13,204 INFO L480 AbstractCegarLoop]: Abstraction has 1875 states and 11063 transitions. [2019-02-18 10:12:13,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:12:13,204 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 11063 transitions. [2019-02-18 10:12:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 10:12:13,207 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:12:13,207 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:12:13,207 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:12:13,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:12:13,207 INFO L82 PathProgramCache]: Analyzing trace with hash -2145066854, now seen corresponding path program 2 times [2019-02-18 10:12:13,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:12:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:12:13,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:12:13,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:12:13,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:12:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:12:13,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:12:13,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:12:13,274 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:12:13,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:12:13,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:12:13,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:12:13,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:12:13,284 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:12:13,284 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:12:13,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-18 10:12:13,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:12:13,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:12:13,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:12:13,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:12:13,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:12:13,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:12:13,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,325 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,328 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:12:13,330 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:13,354 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:13,368 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:13,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:13,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:13,408 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:12:13,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:12:13,465 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,466 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,468 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,469 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:12:13,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,510 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,514 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:12:13,515 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:13,529 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:13,542 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:13,557 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:13,584 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:12:13,584 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:12:13,607 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:12:13,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:13,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:12:13,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 10:12:13,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:13,664 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:12:13,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 10:12:13,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:12:13,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:12:13,759 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-18 10:12:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:12:13,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:12:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:12:13,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:12:13,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-18 10:12:13,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:12:13,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-18 10:12:13,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-18 10:12:13,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-02-18 10:12:13,849 INFO L87 Difference]: Start difference. First operand 1875 states and 11063 transitions. Second operand 8 states. [2019-02-18 10:12:19,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:12:19,418 INFO L93 Difference]: Finished difference Result 1884 states and 11081 transitions. [2019-02-18 10:12:19,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 10:12:19,418 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-02-18 10:12:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:12:19,423 INFO L225 Difference]: With dead ends: 1884 [2019-02-18 10:12:19,423 INFO L226 Difference]: Without dead ends: 1877 [2019-02-18 10:12:19,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:12:19,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2019-02-18 10:12:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1877. [2019-02-18 10:12:25,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1877 states. [2019-02-18 10:12:25,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 11071 transitions. [2019-02-18 10:12:25,443 INFO L78 Accepts]: Start accepts. Automaton has 1877 states and 11071 transitions. Word has length 7 [2019-02-18 10:12:25,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:12:25,443 INFO L480 AbstractCegarLoop]: Abstraction has 1877 states and 11071 transitions. [2019-02-18 10:12:25,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-18 10:12:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1877 states and 11071 transitions. [2019-02-18 10:12:25,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:12:25,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:12:25,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:12:25,446 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:12:25,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:12:25,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1861574920, now seen corresponding path program 1 times [2019-02-18 10:12:25,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:12:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:12:25,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:12:25,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:12:25,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:12:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:12:25,641 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:12:25,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:12:25,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:12:25,642 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 10:12:25,642 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-02-18 10:12:25,643 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:12:25,643 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:12:25,945 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:12:25,945 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:12:25,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:12:25,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:12:25,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:12:25,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:12:25,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:12:25,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:12:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:12:25,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:12:25,962 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:12:25,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:25,987 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:25,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:12:26,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,029 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,032 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:12:26,073 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,076 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:12:26,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:26,099 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:26,116 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:26,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:26,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:12:26,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:12:26,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:12:26,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:12:26,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:12:26,169 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:26,189 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:26,201 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:26,210 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:26,220 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:26,246 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:12:26,246 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:12:26,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-18 10:12:26,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:26,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:12:26,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-18 10:12:26,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,358 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,445 INFO L303 Elim1Store]: Index analysis took 131 ms [2019-02-18 10:12:26,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-02-18 10:12:26,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:26,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:12:26,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-02-18 10:12:26,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:26,504 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:12:26,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 94 [2019-02-18 10:12:26,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:12:26,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:12:26,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-02-18 10:12:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:12:26,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:12:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:12:26,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:12:26,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-18 10:12:26,696 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:12:26,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:12:26,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:12:26,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:12:26,696 INFO L87 Difference]: Start difference. First operand 1877 states and 11071 transitions. Second operand 11 states. [2019-02-18 10:12:35,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:12:35,564 INFO L93 Difference]: Finished difference Result 2991 states and 17341 transitions. [2019-02-18 10:12:35,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 10:12:35,565 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 10:12:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:12:35,572 INFO L225 Difference]: With dead ends: 2991 [2019-02-18 10:12:35,572 INFO L226 Difference]: Without dead ends: 2978 [2019-02-18 10:12:35,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:12:35,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2019-02-18 10:12:43,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2350. [2019-02-18 10:12:43,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2350 states. [2019-02-18 10:12:43,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 13866 transitions. [2019-02-18 10:12:43,287 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 13866 transitions. Word has length 8 [2019-02-18 10:12:43,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:12:43,287 INFO L480 AbstractCegarLoop]: Abstraction has 2350 states and 13866 transitions. [2019-02-18 10:12:43,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:12:43,287 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 13866 transitions. [2019-02-18 10:12:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:12:43,290 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:12:43,290 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:12:43,291 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:12:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:12:43,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1861146186, now seen corresponding path program 1 times [2019-02-18 10:12:43,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:12:43,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:12:43,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:12:43,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:12:43,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:12:43,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:12:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:12:43,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:12:43,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:12:43,391 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 10:12:43,391 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-02-18 10:12:43,392 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:12:43,392 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:12:43,787 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:12:43,787 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 10 fixpoints after 6 different actions. Largest state had 0 variables. [2019-02-18 10:12:43,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:12:43,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:12:43,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:12:43,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:12:43,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:12:43,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:12:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:12:43,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:12:43,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:12:43,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,870 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:12:43,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:12:43,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:43,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:12:43,956 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:43,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:43,988 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:12:44,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:12:44,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:12:44,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:12:44,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:12:44,034 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,056 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,069 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,080 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,089 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,117 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-18 10:12:44,152 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 10:12:44,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,179 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:12:44,180 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-18 10:12:44,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,213 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-02-18 10:12:44,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:12:44,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-18 10:12:44,269 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,270 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,271 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,272 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,274 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,275 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,276 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,277 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,278 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,279 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,279 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:12:44,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-02-18 10:12:44,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:12:44,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-02-18 10:12:44,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,349 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,350 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,350 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:12:44,351 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-02-18 10:12:44,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:12:44,385 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:46, output treesize:34 [2019-02-18 10:12:44,408 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,409 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,410 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,411 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,412 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,413 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,414 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,415 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:12:44,418 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:12:44,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-18 10:12:44,419 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:12:44,450 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:12:44,451 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-02-18 10:12:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:12:44,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:12:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:12:44,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:12:44,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-18 10:12:44,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:12:44,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 10:12:44,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 10:12:44,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2019-02-18 10:12:44,722 INFO L87 Difference]: Start difference. First operand 2350 states and 13866 transitions. Second operand 14 states. [2019-02-18 10:12:54,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:12:54,823 INFO L93 Difference]: Finished difference Result 3181 states and 18621 transitions. [2019-02-18 10:12:54,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 10:12:54,823 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-18 10:12:54,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:12:54,833 INFO L225 Difference]: With dead ends: 3181 [2019-02-18 10:12:54,833 INFO L226 Difference]: Without dead ends: 3179 [2019-02-18 10:12:54,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=188, Invalid=364, Unknown=0, NotChecked=0, Total=552 [2019-02-18 10:12:54,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-02-18 10:13:02,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2326. [2019-02-18 10:13:02,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-02-18 10:13:02,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13718 transitions. [2019-02-18 10:13:02,575 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13718 transitions. Word has length 8 [2019-02-18 10:13:02,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:13:02,575 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13718 transitions. [2019-02-18 10:13:02,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 10:13:02,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13718 transitions. [2019-02-18 10:13:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:13:02,579 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:13:02,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:13:02,579 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:13:02,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:02,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1477451752, now seen corresponding path program 1 times [2019-02-18 10:13:02,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:13:02,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:02,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:02,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:02,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:13:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:02,721 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 10:13:02,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:13:02,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:13:02,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 10:13:02,743 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:13:02,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 10:13:02,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 10:13:02,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-18 10:13:02,744 INFO L87 Difference]: Start difference. First operand 2326 states and 13718 transitions. Second operand 5 states. [2019-02-18 10:13:09,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:13:09,745 INFO L93 Difference]: Finished difference Result 2346 states and 13737 transitions. [2019-02-18 10:13:09,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 10:13:09,746 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-18 10:13:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:13:09,751 INFO L225 Difference]: With dead ends: 2346 [2019-02-18 10:13:09,751 INFO L226 Difference]: Without dead ends: 2337 [2019-02-18 10:13:09,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-18 10:13:09,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-02-18 10:13:17,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 2326. [2019-02-18 10:13:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2019-02-18 10:13:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 13543 transitions. [2019-02-18 10:13:17,449 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 13543 transitions. Word has length 8 [2019-02-18 10:13:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:13:17,449 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 13543 transitions. [2019-02-18 10:13:17,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 10:13:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 13543 transitions. [2019-02-18 10:13:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:13:17,452 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:13:17,453 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:13:17,453 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:13:17,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:17,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 2 times [2019-02-18 10:13:17,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:13:17,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:17,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:17,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:17,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:13:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:17,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:13:17,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:17,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:13:17,591 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:13:17,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:13:17,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:17,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:13:17,599 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:13:17,599 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:13:17,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 10:13:17,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:13:17,606 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:13:17,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:13:17,660 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:13:17,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:13:17,741 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,743 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,744 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,745 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,746 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:13:17,747 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:17,762 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:17,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:17,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:17,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:13:17,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:13:17,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:13:17,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:13:17,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:13:17,825 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:17,847 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:17,860 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:17,871 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:17,880 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:17,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:17,908 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:69, output treesize:66 [2019-02-18 10:13:17,944 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:17,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 10:13:17,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:17,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:17,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-02-18 10:13:17,999 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,000 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,004 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-18 10:13:18,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:18,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:18,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-18 10:13:18,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,066 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,068 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,071 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,072 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,073 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:13:18,074 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-18 10:13:18,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:18,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:18,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:34 [2019-02-18 10:13:18,136 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,137 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,138 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,139 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,140 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,141 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,142 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,146 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,149 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:13:18,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-18 10:13:18,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:18,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:18,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 10:13:18,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,230 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,232 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,233 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,234 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,235 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,236 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:18,237 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:13:18,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-18 10:13:18,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:18,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:18,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:46 [2019-02-18 10:13:20,334 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:20,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:13:20,428 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:20,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:13:20,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-18 10:13:20,446 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:13:20,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-18 10:13:20,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-18 10:13:20,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-02-18 10:13:20,447 INFO L87 Difference]: Start difference. First operand 2326 states and 13543 transitions. Second operand 14 states. [2019-02-18 10:13:28,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:13:28,295 INFO L93 Difference]: Finished difference Result 2345 states and 13559 transitions. [2019-02-18 10:13:28,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:13:28,296 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-02-18 10:13:28,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:13:28,302 INFO L225 Difference]: With dead ends: 2345 [2019-02-18 10:13:28,302 INFO L226 Difference]: Without dead ends: 2338 [2019-02-18 10:13:28,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=184, Invalid=368, Unknown=0, NotChecked=0, Total=552 [2019-02-18 10:13:28,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2019-02-18 10:13:30,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 473. [2019-02-18 10:13:30,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2019-02-18 10:13:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 2593 transitions. [2019-02-18 10:13:30,474 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 2593 transitions. Word has length 8 [2019-02-18 10:13:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:13:30,474 INFO L480 AbstractCegarLoop]: Abstraction has 473 states and 2593 transitions. [2019-02-18 10:13:30,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-18 10:13:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 2593 transitions. [2019-02-18 10:13:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:13:30,475 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:13:30,475 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-02-18 10:13:30,475 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:13:30,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:30,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1700463206, now seen corresponding path program 1 times [2019-02-18 10:13:30,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:13:30,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:30,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:13:30,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:30,476 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:13:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:30,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:13:30,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:30,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:13:30,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 10:13:30,558 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-02-18 10:13:30,559 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:13:30,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:13:30,825 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:13:30,825 INFO L272 AbstractInterpreter]: Visited 7 different actions 11 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:13:30,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:30,825 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:13:30,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:30,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:13:30,834 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:30,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:13:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:30,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:13:30,848 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:13:30,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:13:30,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:30,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:30,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:13:30,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:30,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:30,871 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:30,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:13:30,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 10:13:30,885 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:30,907 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:30,920 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:30,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:30,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:30,956 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:13:30,967 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:30,969 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:30,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:13:30,992 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,067 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,090 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,091 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:13:31,091 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:31,105 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:31,114 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:31,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:31,132 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-18 10:13:31,161 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,162 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 10:13:31,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:31,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:31,172 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-02-18 10:13:31,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,188 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,189 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 10:13:31,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:31,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:31,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:18 [2019-02-18 10:13:31,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,215 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,217 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,222 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-02-18 10:13:31,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:31,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:31,239 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:16 [2019-02-18 10:13:31,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:31,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-02-18 10:13:31,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:31,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:31,278 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:18 [2019-02-18 10:13:31,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:31,294 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:13:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:31,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:13:31,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-18 10:13:31,354 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:13:31,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:13:31,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:13:31,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:13:31,354 INFO L87 Difference]: Start difference. First operand 473 states and 2593 transitions. Second operand 11 states. [2019-02-18 10:13:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:13:33,640 INFO L93 Difference]: Finished difference Result 480 states and 2609 transitions. [2019-02-18 10:13:33,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:13:33,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 10:13:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:13:33,643 INFO L225 Difference]: With dead ends: 480 [2019-02-18 10:13:33,643 INFO L226 Difference]: Without dead ends: 477 [2019-02-18 10:13:33,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:13:33,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-02-18 10:13:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 158. [2019-02-18 10:13:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2019-02-18 10:13:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 805 transitions. [2019-02-18 10:13:34,578 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 805 transitions. Word has length 8 [2019-02-18 10:13:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:13:34,579 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 805 transitions. [2019-02-18 10:13:34,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:13:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 805 transitions. [2019-02-18 10:13:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:13:34,579 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:13:34,579 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:13:34,579 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:13:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1702729308, now seen corresponding path program 1 times [2019-02-18 10:13:34,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:13:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:34,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:34,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:34,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:13:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:13:34,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:34,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:13:34,630 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 10:13:34,630 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-02-18 10:13:34,631 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:13:34,631 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:13:34,905 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:13:34,905 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:13:34,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:34,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:13:34,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:34,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:13:34,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:34,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:13:34,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:34,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:13:34,924 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:13:34,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:13:34,938 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:34,939 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:34,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:13:34,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:34,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:34,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:34,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:13:34,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:34,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:34,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:34,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:34,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:13:34,964 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:34,997 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:35,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:35,018 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:35,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:35,049 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:13:35,061 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:13:35,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,107 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,108 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:13:35,147 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,148 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,149 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,150 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,151 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:13:35,154 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:35,168 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:35,181 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:35,196 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:35,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:35,223 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:13:35,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:13:35,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:35,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:35,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:13:35,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 10:13:35,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:35,321 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:35,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:13:35,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,344 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,346 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,347 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:35,348 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:13:35,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-18 10:13:35,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:35,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:35,371 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:13:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:35,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:13:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:35,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:13:35,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 10:13:35,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:13:35,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:13:35,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:13:35,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:13:35,436 INFO L87 Difference]: Start difference. First operand 158 states and 805 transitions. Second operand 9 states. [2019-02-18 10:13:37,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:13:37,246 INFO L93 Difference]: Finished difference Result 250 states and 1244 transitions. [2019-02-18 10:13:37,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:13:37,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-18 10:13:37,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:13:37,248 INFO L225 Difference]: With dead ends: 250 [2019-02-18 10:13:37,248 INFO L226 Difference]: Without dead ends: 243 [2019-02-18 10:13:37,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:13:37,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-18 10:13:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 217. [2019-02-18 10:13:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-18 10:13:38,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 1122 transitions. [2019-02-18 10:13:38,747 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 1122 transitions. Word has length 8 [2019-02-18 10:13:38,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:13:38,748 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 1122 transitions. [2019-02-18 10:13:38,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:13:38,748 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 1122 transitions. [2019-02-18 10:13:38,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:13:38,749 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:13:38,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:13:38,749 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:13:38,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:38,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1689800014, now seen corresponding path program 1 times [2019-02-18 10:13:38,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:13:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:38,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:38,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:38,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:13:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:13:38,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:38,850 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:13:38,850 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 10:13:38,850 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-02-18 10:13:38,851 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:13:38,851 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:13:39,112 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:13:39,112 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:13:39,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:39,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:13:39,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:39,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:13:39,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:39,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:13:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:39,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:13:39,131 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:13:39,138 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:13:39,144 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,145 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:13:39,154 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,156 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,158 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:13:39,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 46 [2019-02-18 10:13:39,174 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:39,195 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:39,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:39,218 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:39,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:39,244 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2019-02-18 10:13:39,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2019-02-18 10:13:39,280 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,281 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,284 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,284 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2019-02-18 10:13:39,285 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:39,293 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:39,301 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:39,319 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:39,319 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:44, output treesize:46 [2019-02-18 10:13:39,348 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 10:13:39,349 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:39,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:39,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:20 [2019-02-18 10:13:39,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-02-18 10:13:39,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:39,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:39,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:18 [2019-02-18 10:13:39,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,422 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,423 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,424 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:39,427 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:13:39,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 56 [2019-02-18 10:13:39,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:39,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:39,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:22 [2019-02-18 10:13:39,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:39,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:13:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:39,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:13:39,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:13:39,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:13:39,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:13:39,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:13:39,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:13:39,505 INFO L87 Difference]: Start difference. First operand 217 states and 1122 transitions. Second operand 10 states. [2019-02-18 10:13:42,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:13:42,685 INFO L93 Difference]: Finished difference Result 372 states and 1862 transitions. [2019-02-18 10:13:42,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:13:42,686 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-18 10:13:42,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:13:42,687 INFO L225 Difference]: With dead ends: 372 [2019-02-18 10:13:42,687 INFO L226 Difference]: Without dead ends: 362 [2019-02-18 10:13:42,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:13:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2019-02-18 10:13:45,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 274. [2019-02-18 10:13:45,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-02-18 10:13:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 1432 transitions. [2019-02-18 10:13:45,002 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 1432 transitions. Word has length 8 [2019-02-18 10:13:45,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:13:45,002 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 1432 transitions. [2019-02-18 10:13:45,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:13:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 1432 transitions. [2019-02-18 10:13:45,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:13:45,003 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:13:45,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:13:45,004 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:13:45,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:45,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1048110876, now seen corresponding path program 2 times [2019-02-18 10:13:45,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:13:45,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:45,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:45,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:45,005 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:13:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:45,081 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:45,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:45,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:13:45,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:13:45,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:13:45,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:45,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:13:45,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:13:45,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:13:45,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:13:45,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:13:45,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:13:45,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:13:45,106 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:13:45,114 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,115 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:13:45,121 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,123 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:13:45,130 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,133 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:13:45,133 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:45,157 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:45,170 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:45,181 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:45,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:45,209 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:13:45,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,223 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:13:45,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,253 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:13:45,294 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,295 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,300 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:13:45,301 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:45,315 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:45,328 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:45,343 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:45,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:45,370 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:13:45,392 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:13:45,393 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:45,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:45,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 10:13:45,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,440 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,446 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:13:45,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 10:13:45,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:13:45,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:13:45,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:72 [2019-02-18 10:13:45,578 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,579 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,580 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,582 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,583 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,584 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:45,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 10:13:45,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:45,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:45,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:25 [2019-02-18 10:13:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:45,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:13:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:45,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:13:45,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:13:45,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:13:45,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:13:45,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:13:45,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:13:45,690 INFO L87 Difference]: Start difference. First operand 274 states and 1432 transitions. Second operand 10 states. [2019-02-18 10:13:48,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:13:48,535 INFO L93 Difference]: Finished difference Result 332 states and 1700 transitions. [2019-02-18 10:13:48,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:13:48,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-18 10:13:48,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:13:48,537 INFO L225 Difference]: With dead ends: 332 [2019-02-18 10:13:48,537 INFO L226 Difference]: Without dead ends: 325 [2019-02-18 10:13:48,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:13:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-02-18 10:13:50,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 285. [2019-02-18 10:13:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-02-18 10:13:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 1489 transitions. [2019-02-18 10:13:50,923 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 1489 transitions. Word has length 8 [2019-02-18 10:13:50,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:13:50,923 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 1489 transitions. [2019-02-18 10:13:50,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:13:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 1489 transitions. [2019-02-18 10:13:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:13:50,924 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:13:50,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:13:50,924 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:13:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:50,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1051804960, now seen corresponding path program 1 times [2019-02-18 10:13:50,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:13:50,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:50,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:13:50,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:50,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:13:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:51,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:13:51,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:51,074 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:13:51,074 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 10:13:51,074 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-02-18 10:13:51,075 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:13:51,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:13:51,654 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:13:51,654 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:13:51,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:51,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:13:51,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:51,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:13:51,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:51,662 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:13:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:51,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:13:51,673 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:13:51,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:13:51,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,742 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:13:51,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,788 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,788 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:13:51,789 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:51,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:51,816 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:51,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:51,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:13:51,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:13:51,858 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:13:51,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:13:51,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:13:51,871 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:51,891 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:51,903 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:51,912 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:51,922 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:51,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:51,948 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:13:51,995 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:51,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:13:51,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:52,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:52,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:13:52,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:52,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:52,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:52,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:52,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:52,041 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:13:52,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 10:13:52,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:52,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:52,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-18 10:13:52,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:52,083 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:52,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:52,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:52,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:52,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:52,087 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:13:52,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-02-18 10:13:52,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:52,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:52,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-18 10:13:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:52,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:13:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:52,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:13:52,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-18 10:13:52,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:13:52,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:13:52,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:13:52,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:13:52,194 INFO L87 Difference]: Start difference. First operand 285 states and 1489 transitions. Second operand 10 states. [2019-02-18 10:13:54,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:13:54,807 INFO L93 Difference]: Finished difference Result 294 states and 1507 transitions. [2019-02-18 10:13:54,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:13:54,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-02-18 10:13:54,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:13:54,809 INFO L225 Difference]: With dead ends: 294 [2019-02-18 10:13:54,809 INFO L226 Difference]: Without dead ends: 287 [2019-02-18 10:13:54,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:13:54,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-18 10:13:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-02-18 10:13:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-02-18 10:13:57,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1484 transitions. [2019-02-18 10:13:57,193 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1484 transitions. Word has length 8 [2019-02-18 10:13:57,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:13:57,193 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1484 transitions. [2019-02-18 10:13:57,193 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:13:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1484 transitions. [2019-02-18 10:13:57,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:13:57,194 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:13:57,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:13:57,194 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:13:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash -944676524, now seen corresponding path program 1 times [2019-02-18 10:13:57,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:13:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:57,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:57,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:13:57,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:13:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:57,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:13:57,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:57,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:13:57,356 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 10:13:57,356 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-02-18 10:13:57,357 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:13:57,358 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:13:57,929 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:13:57,929 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:13:57,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:13:57,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:13:57,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:13:57,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:13:57,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:13:57,937 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:13:57,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:13:57,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:13:57,946 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:13:57,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:13:57,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:57,986 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:57,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:13:57,997 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:57,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:57,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:57,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:13:58,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:13:58,008 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:58,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:58,043 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:58,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:58,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:58,082 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:13:58,095 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:13:58,127 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,129 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,131 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,132 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:13:58,433 WARN L181 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2019-02-18 10:13:58,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,437 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,438 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,439 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,441 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:13:58,442 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:58,456 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:58,469 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:58,484 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:13:58,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:58,511 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:13:58,542 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:13:58,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:58,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:13:58,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-18 10:13:58,595 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,596 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,598 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,601 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,602 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,603 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,612 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 10:13:58,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:13:58,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:13:58,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:74 [2019-02-18 10:13:58,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,783 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:13:58,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,784 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 69 [2019-02-18 10:13:58,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:58,833 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,834 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,835 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,836 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,837 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,838 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,839 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,840 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,841 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:13:58,844 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:13:58,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-18 10:13:58,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:13:58,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:13:58,894 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:92, output treesize:70 [2019-02-18 10:13:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:59,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:13:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:13:59,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:13:59,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-18 10:13:59,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:13:59,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:13:59,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:13:59,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:13:59,496 INFO L87 Difference]: Start difference. First operand 284 states and 1484 transitions. Second operand 11 states. [2019-02-18 10:13:59,974 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 65 [2019-02-18 10:14:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:14:03,000 INFO L93 Difference]: Finished difference Result 364 states and 1818 transitions. [2019-02-18 10:14:03,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 10:14:03,000 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 10:14:03,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:14:03,002 INFO L225 Difference]: With dead ends: 364 [2019-02-18 10:14:03,002 INFO L226 Difference]: Without dead ends: 357 [2019-02-18 10:14:03,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-02-18 10:14:03,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-02-18 10:14:05,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 283. [2019-02-18 10:14:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-02-18 10:14:05,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 1479 transitions. [2019-02-18 10:14:05,514 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 1479 transitions. Word has length 8 [2019-02-18 10:14:05,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:14:05,515 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 1479 transitions. [2019-02-18 10:14:05,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:14:05,515 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 1479 transitions. [2019-02-18 10:14:05,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:14:05,515 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:14:05,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:14:05,516 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:14:05,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:14:05,516 INFO L82 PathProgramCache]: Analyzing trace with hash -937288356, now seen corresponding path program 1 times [2019-02-18 10:14:05,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:14:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:05,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:14:05,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:05,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:14:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:14:05,704 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2019-02-18 10:14:05,733 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:14:05,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:14:05,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:14:05,734 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 10:14:05,734 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-02-18 10:14:05,735 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:14:05,735 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:14:06,333 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:14:06,333 INFO L272 AbstractInterpreter]: Visited 8 different actions 16 times. Merged at 2 different actions 2 times. Never widened. Found 9 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:14:06,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:14:06,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:14:06,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:14:06,334 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:14:06,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:14:06,341 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:14:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:14:06,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:14:06,350 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:14:06,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:14:06,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:14:06,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,377 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:14:06,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,389 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:14:06,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:06,422 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:06,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:06,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:06,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:06,472 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:14:06,485 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,487 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:14:06,517 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,519 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,520 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:14:06,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,562 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:14:06,565 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:06,579 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:06,593 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:06,608 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:06,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:06,634 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:14:06,676 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:14:06,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:06,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:06,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:14:06,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,718 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,720 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-02-18 10:14:06,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:06,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:06,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-18 10:14:06,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,762 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,765 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,766 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,767 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,768 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:06,769 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:14:06,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 10:14:06,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:06,791 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:06,791 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:14:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:14:06,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:14:06,842 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:14:06,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:14:06,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-02-18 10:14:06,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:14:06,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 10:14:06,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 10:14:06,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:14:06,860 INFO L87 Difference]: Start difference. First operand 283 states and 1479 transitions. Second operand 9 states. [2019-02-18 10:14:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:14:09,865 INFO L93 Difference]: Finished difference Result 319 states and 1617 transitions. [2019-02-18 10:14:09,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 10:14:09,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-02-18 10:14:09,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:14:09,866 INFO L225 Difference]: With dead ends: 319 [2019-02-18 10:14:09,866 INFO L226 Difference]: Without dead ends: 312 [2019-02-18 10:14:09,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:14:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-02-18 10:14:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 304. [2019-02-18 10:14:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-18 10:14:12,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 1600 transitions. [2019-02-18 10:14:12,780 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 1600 transitions. Word has length 8 [2019-02-18 10:14:12,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:14:12,780 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 1600 transitions. [2019-02-18 10:14:12,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 10:14:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 1600 transitions. [2019-02-18 10:14:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:14:12,781 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:14:12,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:14:12,781 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:14:12,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:14:12,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1115262138, now seen corresponding path program 1 times [2019-02-18 10:14:12,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:14:12,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:12,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:14:12,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:12,782 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:14:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:14:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:14:12,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:14:12,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:14:12,914 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-02-18 10:14:12,914 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-02-18 10:14:12,915 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:14:12,915 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:14:13,173 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:14:13,173 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:14:13,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:14:13,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:14:13,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:14:13,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:14:13,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:14:13,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:14:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:14:13,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:14:13,192 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:14:13,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:14:13,252 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,254 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:14:13,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,299 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,304 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,305 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:14:13,306 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,324 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,340 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,357 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:14:13,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:14:13,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:14:13,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:14:13,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:14:13,393 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,415 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,426 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,435 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,445 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:13,471 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:14:13,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:14:13,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:14:13,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:14:13,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-18 10:14:13,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-02-18 10:14:13,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,747 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,748 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,749 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,750 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,752 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,753 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,754 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-18 10:14:13,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:14:13,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:108, output treesize:68 [2019-02-18 10:14:13,842 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,843 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,844 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,845 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,846 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,847 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,848 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,849 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,850 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,852 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:14:13,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-02-18 10:14:13,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,906 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,907 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,908 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,910 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,911 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:14:13,912 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:13,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 65 [2019-02-18 10:14:13,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:13,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:14:13,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-02-18 10:14:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:14:14,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:14:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:14:14,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:14:14,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-02-18 10:14:14,060 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:14:14,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:14:14,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:14:14,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:14:14,060 INFO L87 Difference]: Start difference. First operand 304 states and 1600 transitions. Second operand 11 states. [2019-02-18 10:14:15,362 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-02-18 10:14:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:14:18,287 INFO L93 Difference]: Finished difference Result 392 states and 1929 transitions. [2019-02-18 10:14:18,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:14:18,287 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-02-18 10:14:18,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:14:18,288 INFO L225 Difference]: With dead ends: 392 [2019-02-18 10:14:18,288 INFO L226 Difference]: Without dead ends: 386 [2019-02-18 10:14:18,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2019-02-18 10:14:18,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2019-02-18 10:14:21,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 315. [2019-02-18 10:14:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-02-18 10:14:21,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 1665 transitions. [2019-02-18 10:14:21,381 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 1665 transitions. Word has length 8 [2019-02-18 10:14:21,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:14:21,381 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 1665 transitions. [2019-02-18 10:14:21,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:14:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 1665 transitions. [2019-02-18 10:14:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-18 10:14:21,382 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:14:21,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:14:21,382 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:14:21,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:14:21,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-02-18 10:14:21,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:14:21,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:21,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:14:21,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:21,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:14:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:14:21,463 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:14:21,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 10:14:21,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-18 10:14:21,464 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 10:14:21,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-18 10:14:21,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-18 10:14:21,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-02-18 10:14:21,464 INFO L87 Difference]: Start difference. First operand 315 states and 1665 transitions. Second operand 5 states. [2019-02-18 10:14:24,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:14:24,409 INFO L93 Difference]: Finished difference Result 320 states and 1669 transitions. [2019-02-18 10:14:24,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-18 10:14:24,410 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-02-18 10:14:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:14:24,411 INFO L225 Difference]: With dead ends: 320 [2019-02-18 10:14:24,411 INFO L226 Difference]: Without dead ends: 315 [2019-02-18 10:14:24,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-02-18 10:14:24,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-18 10:14:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 314. [2019-02-18 10:14:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-02-18 10:14:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 1654 transitions. [2019-02-18 10:14:27,597 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 1654 transitions. Word has length 8 [2019-02-18 10:14:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:14:27,597 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 1654 transitions. [2019-02-18 10:14:27,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-18 10:14:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 1654 transitions. [2019-02-18 10:14:27,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:14:27,598 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:14:27,598 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:14:27,598 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:14:27,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:14:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 95484720, now seen corresponding path program 3 times [2019-02-18 10:14:27,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:14:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:27,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:14:27,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:27,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:14:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:14:27,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:14:27,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:14:27,697 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:14:27,697 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:14:27,697 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:14:27,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:14:27,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:14:27,706 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:14:27,707 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:14:27,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:14:27,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:14:27,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:14:27,715 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:14:27,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:14:27,760 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,761 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,763 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,764 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:14:27,802 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,805 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,806 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,807 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,809 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:14:27,810 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:27,824 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:27,837 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:27,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:27,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:14:27,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:14:27,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:14:27,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:14:27,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:14:27,885 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:27,906 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:27,917 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:27,927 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:27,936 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:27,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:27,962 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:14:27,988 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:27,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-18 10:14:27,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:28,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:28,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-02-18 10:14:28,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,037 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,038 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,040 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,041 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-02-18 10:14:28,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:28,072 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:28,073 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:46 [2019-02-18 10:14:28,097 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,099 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,100 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,101 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,104 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,105 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-02-18 10:14:28,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:14:28,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:14:28,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-02-18 10:14:28,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,259 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:28,267 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:14:28,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-18 10:14:28,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:28,289 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:28,289 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-02-18 10:14:28,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:14:28,314 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:14:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:14:28,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:14:28,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 10:14:28,392 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:14:28,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:14:28,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:14:28,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:14:28,393 INFO L87 Difference]: Start difference. First operand 314 states and 1654 transitions. Second operand 12 states. [2019-02-18 10:14:34,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:14:34,588 INFO L93 Difference]: Finished difference Result 601 states and 3111 transitions. [2019-02-18 10:14:34,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:14:34,589 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 10:14:34,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:14:34,590 INFO L225 Difference]: With dead ends: 601 [2019-02-18 10:14:34,590 INFO L226 Difference]: Without dead ends: 591 [2019-02-18 10:14:34,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2019-02-18 10:14:34,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-02-18 10:14:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 448. [2019-02-18 10:14:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-02-18 10:14:39,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 2380 transitions. [2019-02-18 10:14:39,752 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 2380 transitions. Word has length 9 [2019-02-18 10:14:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:14:39,752 INFO L480 AbstractCegarLoop]: Abstraction has 448 states and 2380 transitions. [2019-02-18 10:14:39,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:14:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 2380 transitions. [2019-02-18 10:14:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:14:39,753 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:14:39,753 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:14:39,753 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:14:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:14:39,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1988764338, now seen corresponding path program 1 times [2019-02-18 10:14:39,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:14:39,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:39,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:14:39,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:39,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:14:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:14:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:14:39,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:14:39,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:14:39,858 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 10:14:39,858 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-18 10:14:39,858 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:14:39,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:14:40,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:14:40,134 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:14:40,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:14:40,135 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:14:40,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:14:40,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:14:40,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:14:40,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:14:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:14:40,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:14:40,151 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:14:40,167 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,171 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:14:40,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,214 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,216 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,218 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:14:40,255 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,257 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,258 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,265 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:14:40,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:40,283 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:40,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:40,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:40,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:14:40,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:14:40,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:14:40,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:14:40,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:14:40,352 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:40,373 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:40,384 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:40,393 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:40,403 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:40,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:40,429 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:14:40,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-18 10:14:40,456 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:40,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:40,480 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 10:14:40,501 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,502 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,503 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,504 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,506 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,507 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,508 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 76 [2019-02-18 10:14:40,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:40,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:40,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:36 [2019-02-18 10:14:40,556 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,557 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,558 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,559 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,560 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,561 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,564 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,565 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,566 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:14:40,567 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:40,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 93 [2019-02-18 10:14:40,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:14:40,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:14:40,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:64 [2019-02-18 10:14:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:14:40,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:14:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:14:40,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:14:40,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:14:40,758 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:14:40,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:14:40,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:14:40,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:14:40,758 INFO L87 Difference]: Start difference. First operand 448 states and 2380 transitions. Second operand 10 states. [2019-02-18 10:14:50,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:14:50,368 INFO L93 Difference]: Finished difference Result 731 states and 3887 transitions. [2019-02-18 10:14:50,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:14:50,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-18 10:14:50,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:14:50,370 INFO L225 Difference]: With dead ends: 731 [2019-02-18 10:14:50,370 INFO L226 Difference]: Without dead ends: 718 [2019-02-18 10:14:50,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:14:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-02-18 10:14:58,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 399. [2019-02-18 10:14:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2019-02-18 10:14:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 2082 transitions. [2019-02-18 10:14:58,769 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 2082 transitions. Word has length 9 [2019-02-18 10:14:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:14:58,769 INFO L480 AbstractCegarLoop]: Abstraction has 399 states and 2082 transitions. [2019-02-18 10:14:58,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:14:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 2082 transitions. [2019-02-18 10:14:58,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:14:58,770 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:14:58,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:14:58,770 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:14:58,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:14:58,771 INFO L82 PathProgramCache]: Analyzing trace with hash 2086595996, now seen corresponding path program 1 times [2019-02-18 10:14:58,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:14:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:58,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:14:58,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:14:58,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:14:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:14:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:14:58,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:14:58,903 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:14:58,903 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 10:14:58,903 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-02-18 10:14:58,904 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:14:58,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:14:59,253 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:14:59,253 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:14:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:14:59,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:14:59,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:14:59,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:14:59,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:14:59,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:14:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:14:59,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:14:59,274 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:14:59,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,296 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:14:59,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:14:59,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,387 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,390 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,393 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:14:59,394 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,411 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,444 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:14:59,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:14:59,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:14:59,495 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:14:59,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:14:59,498 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,535 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,547 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,555 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,564 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:59,591 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:14:59,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:14:59,638 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,653 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:55, output treesize:33 [2019-02-18 10:14:59,678 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,679 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,680 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 59 [2019-02-18 10:14:59,684 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:59,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:27 [2019-02-18 10:14:59,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,734 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:14:59,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 10:14:59,735 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:59,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:27 [2019-02-18 10:14:59,777 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,778 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:14:59,785 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:14:59,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 73 [2019-02-18 10:14:59,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:14:59,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:14:59,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:35 [2019-02-18 10:15:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:15:00,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:15:00,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:15:00,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:15:00,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-18 10:15:00,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:15:00,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:15:00,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:15:00,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:15:00,090 INFO L87 Difference]: Start difference. First operand 399 states and 2082 transitions. Second operand 12 states. [2019-02-18 10:15:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:15:09,993 INFO L93 Difference]: Finished difference Result 480 states and 2456 transitions. [2019-02-18 10:15:09,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:15:09,994 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 10:15:09,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:15:09,995 INFO L225 Difference]: With dead ends: 480 [2019-02-18 10:15:09,995 INFO L226 Difference]: Without dead ends: 473 [2019-02-18 10:15:09,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=314, Unknown=0, NotChecked=0, Total=462 [2019-02-18 10:15:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-02-18 10:15:13,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 193. [2019-02-18 10:15:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-18 10:15:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 982 transitions. [2019-02-18 10:15:13,199 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 982 transitions. Word has length 9 [2019-02-18 10:15:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:15:13,199 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 982 transitions. [2019-02-18 10:15:13,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:15:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 982 transitions. [2019-02-18 10:15:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:15:13,200 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:15:13,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:15:13,200 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:15:13,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:15:13,200 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-02-18 10:15:13,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:15:13,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:15:13,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:15:13,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:15:13,201 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:15:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:15:13,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:15:13,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:15:13,313 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:15:13,313 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 10:15:13,314 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-18 10:15:13,315 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:15:13,315 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:15:13,577 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:15:13,577 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:15:13,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:15:13,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:15:13,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:15:13,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:15:13,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:15:13,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:15:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:15:13,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:15:13,600 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:15:13,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:15:13,614 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,616 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:15:13,621 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,623 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,625 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:15:13,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:15:13,637 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:13,662 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:13,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:13,683 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:13,692 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:13,710 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:15:13,723 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:15:13,755 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,756 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,758 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,759 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:15:13,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,799 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,800 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,801 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,803 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:15:13,804 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:13,818 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:13,831 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:13,846 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:13,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:15:13,873 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:15:13,917 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-02-18 10:15:13,917 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:13,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:15:13,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:15:13,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:13,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-02-18 10:15:13,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:13,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:15:13,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:27 [2019-02-18 10:15:14,002 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:14,003 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:14,004 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:14,005 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:14,006 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:14,007 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:14,008 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:14,008 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:15:14,009 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:14,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-18 10:15:14,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:14,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:15:14,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 10:15:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:15:14,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:15:14,083 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:15:14,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:15:14,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:15:14,103 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:15:14,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:15:14,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:15:14,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:15:14,103 INFO L87 Difference]: Start difference. First operand 193 states and 982 transitions. Second operand 10 states. [2019-02-18 10:15:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:15:19,333 INFO L93 Difference]: Finished difference Result 258 states and 1245 transitions. [2019-02-18 10:15:19,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:15:19,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-18 10:15:19,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:15:19,335 INFO L225 Difference]: With dead ends: 258 [2019-02-18 10:15:19,335 INFO L226 Difference]: Without dead ends: 243 [2019-02-18 10:15:19,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:15:19,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-02-18 10:15:23,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 219. [2019-02-18 10:15:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-02-18 10:15:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 1113 transitions. [2019-02-18 10:15:23,830 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 1113 transitions. Word has length 9 [2019-02-18 10:15:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:15:23,830 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 1113 transitions. [2019-02-18 10:15:23,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:15:23,830 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 1113 transitions. [2019-02-18 10:15:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:15:23,831 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:15:23,831 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:15:23,831 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:15:23,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:15:23,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1629971288, now seen corresponding path program 1 times [2019-02-18 10:15:23,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:15:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:15:23,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:15:23,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:15:23,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:15:23,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:15:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:15:23,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:15:23,989 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:15:23,989 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 10:15:23,989 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-02-18 10:15:23,990 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:15:23,990 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:15:24,683 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:15:24,683 INFO L272 AbstractInterpreter]: Visited 9 different actions 19 times. Merged at 2 different actions 2 times. Never widened. Found 12 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:15:24,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:15:24,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:15:24,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:15:24,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:15:24,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:15:24,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:15:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:15:24,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:15:24,701 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:15:24,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:15:24,710 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,712 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:15:24,717 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,719 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,721 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,722 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:15:24,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:15:24,734 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:24,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:24,774 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:24,783 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:24,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:24,813 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:15:24,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:15:24,857 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,858 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,860 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,861 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,862 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:15:24,899 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,901 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,904 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:24,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:15:24,905 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:24,919 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:24,933 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:24,948 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:24,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:24,974 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-02-18 10:15:25,010 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:15:25,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:25,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:15:25,036 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-02-18 10:15:25,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,063 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,064 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,065 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,069 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,070 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,070 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:15:25,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 80 [2019-02-18 10:15:25,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:15:25,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:15:25,166 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:56, output treesize:72 [2019-02-18 10:15:25,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,211 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:15:25,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 53 [2019-02-18 10:15:25,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:25,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,261 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,262 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,263 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,264 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,265 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,266 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,267 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,268 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 90 [2019-02-18 10:15:25,269 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:25,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:15:25,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:92, output treesize:68 [2019-02-18 10:15:25,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,384 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:15:25,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-02-18 10:15:25,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:25,442 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,444 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,445 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,446 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,447 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:25,447 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:15:25,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2019-02-18 10:15:25,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:25,489 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:15:25,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:90, output treesize:70 [2019-02-18 10:15:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:15:25,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:15:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:15:25,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:15:25,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 10:15:25,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:15:25,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:15:25,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:15:25,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:15:25,595 INFO L87 Difference]: Start difference. First operand 219 states and 1113 transitions. Second operand 12 states. [2019-02-18 10:15:31,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:15:31,639 INFO L93 Difference]: Finished difference Result 295 states and 1406 transitions. [2019-02-18 10:15:31,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 10:15:31,640 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 10:15:31,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:15:31,641 INFO L225 Difference]: With dead ends: 295 [2019-02-18 10:15:31,641 INFO L226 Difference]: Without dead ends: 284 [2019-02-18 10:15:31,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=286, Unknown=0, NotChecked=0, Total=420 [2019-02-18 10:15:31,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-18 10:15:36,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 225. [2019-02-18 10:15:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-02-18 10:15:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1147 transitions. [2019-02-18 10:15:36,284 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1147 transitions. Word has length 9 [2019-02-18 10:15:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:15:36,284 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1147 transitions. [2019-02-18 10:15:36,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:15:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1147 transitions. [2019-02-18 10:15:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:15:36,285 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:15:36,285 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:15:36,285 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:15:36,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:15:36,285 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-02-18 10:15:36,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:15:36,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:15:36,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:15:36,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:15:36,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:15:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:15:36,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-02-18 10:15:36,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:15:36,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:15:36,385 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 10:15:36,385 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-02-18 10:15:36,386 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:15:36,386 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:15:36,857 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:15:36,857 INFO L272 AbstractInterpreter]: Visited 8 different actions 14 times. Merged at 2 different actions 2 times. Never widened. Found 6 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-18 10:15:36,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:15:36,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:15:36,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:15:36,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:15:36,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:15:36,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:15:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:15:36,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:15:36,879 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:15:36,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:15:36,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:36,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:36,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:15:36,898 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:36,900 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:36,902 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:36,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:15:36,905 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:36,909 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:36,911 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:36,913 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:36,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:15:36,914 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:36,946 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:36,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:36,968 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:36,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:36,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:15:37,011 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:15:37,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,046 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:15:37,084 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,085 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,086 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,087 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,089 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:15:37,090 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:37,104 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:37,117 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:37,133 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:37,159 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:15:37,159 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:61, output treesize:62 [2019-02-18 10:15:37,175 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-02-18 10:15:37,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:37,202 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:15:37,203 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-02-18 10:15:37,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,219 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,220 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,221 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,224 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-02-18 10:15:37,235 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:15:37,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:15:37,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-02-18 10:15:37,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,368 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,369 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,370 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:37,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-02-18 10:15:37,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:37,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:15:37,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:45, output treesize:25 [2019-02-18 10:15:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:15:37,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:15:37,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:15:37,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:15:37,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:15:37,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:15:37,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:15:37,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:15:37,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:15:37,458 INFO L87 Difference]: Start difference. First operand 225 states and 1147 transitions. Second operand 10 states. [2019-02-18 10:15:44,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:15:44,225 INFO L93 Difference]: Finished difference Result 328 states and 1595 transitions. [2019-02-18 10:15:44,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:15:44,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-18 10:15:44,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:15:44,227 INFO L225 Difference]: With dead ends: 328 [2019-02-18 10:15:44,227 INFO L226 Difference]: Without dead ends: 315 [2019-02-18 10:15:44,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-02-18 10:15:44,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-02-18 10:15:50,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 258. [2019-02-18 10:15:50,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-02-18 10:15:50,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 1289 transitions. [2019-02-18 10:15:50,835 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 1289 transitions. Word has length 9 [2019-02-18 10:15:50,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:15:50,835 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 1289 transitions. [2019-02-18 10:15:50,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:15:50,835 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 1289 transitions. [2019-02-18 10:15:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:15:50,835 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:15:50,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:15:50,836 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:15:50,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:15:50,836 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-02-18 10:15:50,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:15:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:15:50,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:15:50,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:15:50,837 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:15:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:15:50,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:15:50,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:15:50,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:15:50,946 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 10:15:50,946 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-02-18 10:15:50,947 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:15:50,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:15:51,206 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:15:51,207 INFO L272 AbstractInterpreter]: Visited 9 different actions 13 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:15:51,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:15:51,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:15:51,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:15:51,207 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:15:51,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:15:51,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:15:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:15:51,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:15:51,247 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:15:51,282 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,283 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:15:51,315 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,317 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,318 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,319 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:15:51,362 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,363 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,364 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,365 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,366 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,367 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:15:51,368 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:51,385 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:51,402 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:51,421 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:51,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:15:51,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:15:51,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:15:51,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:15:51,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:15:51,456 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:51,480 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:51,493 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:51,503 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:51,512 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:15:51,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:15:51,541 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 10:15:51,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:15:51,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:51,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:15:51,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 10:15:51,629 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,630 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,631 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-02-18 10:15:51,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:51,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:15:51,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-02-18 10:15:51,693 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,694 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,695 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,696 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,697 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,698 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,699 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,701 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:15:51,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:15:51,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-18 10:15:51,703 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:15:51,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-02-18 10:15:51,738 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-02-18 10:15:51,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:15:51,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:15:51,803 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:15:51,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:15:51,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 10:15:51,821 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:15:51,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-18 10:15:51,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-18 10:15:51,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-02-18 10:15:51,822 INFO L87 Difference]: Start difference. First operand 258 states and 1289 transitions. Second operand 10 states. [2019-02-18 10:16:00,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:16:00,943 INFO L93 Difference]: Finished difference Result 326 states and 1564 transitions. [2019-02-18 10:16:00,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:16:00,944 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-02-18 10:16:00,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:16:00,945 INFO L225 Difference]: With dead ends: 326 [2019-02-18 10:16:00,945 INFO L226 Difference]: Without dead ends: 313 [2019-02-18 10:16:00,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:16:00,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-02-18 10:16:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 284. [2019-02-18 10:16:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-02-18 10:16:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 1425 transitions. [2019-02-18 10:16:08,982 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 1425 transitions. Word has length 9 [2019-02-18 10:16:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:16:08,982 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 1425 transitions. [2019-02-18 10:16:08,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-18 10:16:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 1425 transitions. [2019-02-18 10:16:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:16:08,983 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:16:08,983 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:16:08,983 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:16:08,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:16:08,983 INFO L82 PathProgramCache]: Analyzing trace with hash -561287958, now seen corresponding path program 1 times [2019-02-18 10:16:08,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:16:08,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:16:08,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:16:08,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:16:08,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:16:08,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:16:09,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-18 10:16:09,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:16:09,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:16:09,056 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 10:16:09,056 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-02-18 10:16:09,057 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:16:09,057 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:16:09,364 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:16:09,365 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:16:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:16:09,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:16:09,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:16:09,365 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:16:09,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:16:09,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:16:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:16:09,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:16:09,419 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:16:09,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:16:09,518 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:09,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:09,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:16:09,599 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:09,620 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:09,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:09,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:16:09,682 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:09,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:09,751 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:09,772 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:09,773 INFO L303 Elim1Store]: Index analysis took 124 ms [2019-02-18 10:16:09,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:16:09,774 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:09,918 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:09,930 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:09,940 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:09,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:09,968 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:16:09,981 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:09,983 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:09,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:16:10,012 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,013 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,015 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,016 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:16:10,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,054 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,055 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,058 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:16:10,059 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:10,073 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:10,086 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:10,101 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:10,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:16:10,128 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:16:10,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:16:10,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:16:10,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:16:10,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-02-18 10:16:10,291 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,292 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,293 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,293 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:16:10,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 58 [2019-02-18 10:16:10,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:10,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:16:10,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:31 [2019-02-18 10:16:10,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-02-18 10:16:10,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:10,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:16:10,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-02-18 10:16:10,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,376 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,380 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:10,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 12 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 81 [2019-02-18 10:16:10,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:10,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:16:10,411 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:29 [2019-02-18 10:16:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:16:10,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:16:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:16:10,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:16:10,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-18 10:16:10,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:16:10,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:16:10,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:16:10,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:16:10,492 INFO L87 Difference]: Start difference. First operand 284 states and 1425 transitions. Second operand 11 states. [2019-02-18 10:16:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:16:21,547 INFO L93 Difference]: Finished difference Result 400 states and 1978 transitions. [2019-02-18 10:16:21,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 10:16:21,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-18 10:16:21,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:16:21,549 INFO L225 Difference]: With dead ends: 400 [2019-02-18 10:16:21,549 INFO L226 Difference]: Without dead ends: 393 [2019-02-18 10:16:21,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=193, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:16:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-02-18 10:16:31,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 366. [2019-02-18 10:16:31,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-02-18 10:16:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 1845 transitions. [2019-02-18 10:16:31,642 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 1845 transitions. Word has length 9 [2019-02-18 10:16:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:16:31,642 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 1845 transitions. [2019-02-18 10:16:31,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:16:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 1845 transitions. [2019-02-18 10:16:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:16:31,643 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:16:31,643 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:16:31,643 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:16:31,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:16:31,643 INFO L82 PathProgramCache]: Analyzing trace with hash -975025366, now seen corresponding path program 1 times [2019-02-18 10:16:31,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:16:31,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:16:31,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:16:31,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:16:31,644 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:16:31,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:16:31,828 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 16 [2019-02-18 10:16:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-18 10:16:31,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:16:31,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:16:31,888 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 10:16:31,888 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [29] [2019-02-18 10:16:31,889 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:16:31,889 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:16:32,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:16:32,148 INFO L272 AbstractInterpreter]: Visited 8 different actions 12 times. Merged at 1 different actions 1 times. Never widened. Found 6 fixpoints after 4 different actions. Largest state had 0 variables. [2019-02-18 10:16:32,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:16:32,148 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:16:32,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:16:32,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:16:32,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:16:32,157 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:16:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:16:32,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:16:32,165 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:16:32,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:16:32,177 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,179 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:16:32,203 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,204 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:16:32,208 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,210 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,211 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,212 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:16:32,213 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,238 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,260 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,288 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:16:32,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,302 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:16:32,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,334 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:16:32,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,375 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:16:32,380 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,394 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,408 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,423 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:16:32,450 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:61, output treesize:62 [2019-02-18 10:16:32,474 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:16:32,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:16:32,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:16:32,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:94 [2019-02-18 10:16:32,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,642 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,643 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:16:32,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 62 [2019-02-18 10:16:32,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,700 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,701 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,702 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,703 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,704 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,706 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:16:32,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 79 [2019-02-18 10:16:32,707 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:16:32,751 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:74 [2019-02-18 10:16:32,790 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,791 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,792 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,793 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,794 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,795 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,796 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,797 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,798 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 82 [2019-02-18 10:16:32,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,851 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,852 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,853 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,867 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,869 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,869 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:16:32,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 65 [2019-02-18 10:16:32,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:32,909 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:16:32,909 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:100, output treesize:74 [2019-02-18 10:16:32,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,951 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,952 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,953 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,954 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,955 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,957 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,958 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,959 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,960 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,961 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,962 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,963 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,964 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:32,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 102 [2019-02-18 10:16:32,965 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:33,022 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:33,023 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:33,024 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:33,025 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:33,026 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:33,027 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:33,028 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-02-18 10:16:33,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:33,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:16:33,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-02-18 10:16:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:16:33,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:16:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:16:33,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:16:33,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-02-18 10:16:33,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:16:33,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 10:16:33,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 10:16:33,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-02-18 10:16:33,174 INFO L87 Difference]: Start difference. First operand 366 states and 1845 transitions. Second operand 11 states. [2019-02-18 10:16:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:16:45,279 INFO L93 Difference]: Finished difference Result 441 states and 2134 transitions. [2019-02-18 10:16:45,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 10:16:45,280 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-02-18 10:16:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:16:45,281 INFO L225 Difference]: With dead ends: 441 [2019-02-18 10:16:45,282 INFO L226 Difference]: Without dead ends: 428 [2019-02-18 10:16:45,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=122, Invalid=258, Unknown=0, NotChecked=0, Total=380 [2019-02-18 10:16:45,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-02-18 10:16:55,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 367. [2019-02-18 10:16:55,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2019-02-18 10:16:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 1844 transitions. [2019-02-18 10:16:55,287 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 1844 transitions. Word has length 9 [2019-02-18 10:16:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:16:55,287 INFO L480 AbstractCegarLoop]: Abstraction has 367 states and 1844 transitions. [2019-02-18 10:16:55,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 10:16:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 1844 transitions. [2019-02-18 10:16:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:16:55,288 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:16:55,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:16:55,288 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:16:55,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:16:55,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1143531808, now seen corresponding path program 1 times [2019-02-18 10:16:55,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:16:55,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:16:55,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:16:55,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:16:55,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:16:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:16:55,582 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2019-02-18 10:16:55,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-02-18 10:16:55,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:16:55,664 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:16:55,664 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-02-18 10:16:55,664 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-02-18 10:16:55,664 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:16:55,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:16:56,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:16:56,005 INFO L272 AbstractInterpreter]: Visited 9 different actions 14 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:16:56,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:16:56,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:16:56,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:16:56,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:16:56,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:16:56,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:16:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:16:56,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:16:56,022 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:16:56,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:16:56,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,034 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:16:56,039 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,042 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,044 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,044 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:16:56,047 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,051 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,053 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,056 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:16:56,057 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,086 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,100 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,111 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,139 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:16:56,153 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,155 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:16:56,184 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,185 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,186 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,187 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:16:56,225 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,226 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,227 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,228 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,229 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,231 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:16:56,232 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,246 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,260 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,275 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:16:56,301 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:16:56,333 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:16:56,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:16:56,431 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:16:56,431 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-18 10:16:56,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,511 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,512 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,513 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2019-02-18 10:16:56,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,569 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,571 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,572 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,573 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,574 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 96 [2019-02-18 10:16:56,577 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:16:56,626 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:68 [2019-02-18 10:16:56,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,667 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,668 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,669 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,670 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,671 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,672 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,673 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,674 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:16:56,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-02-18 10:16:56,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,736 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,737 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,737 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:16:56,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 78 [2019-02-18 10:16:56,739 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:16:56,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:62 [2019-02-18 10:16:56,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,824 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,825 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,826 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,827 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,828 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,829 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,830 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,830 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:16:56,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 83 [2019-02-18 10:16:56,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,880 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,881 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,882 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,884 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,885 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,886 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,887 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:16:56,893 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:16:56,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 106 [2019-02-18 10:16:56,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:16:56,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:16:56,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:66 [2019-02-18 10:16:56,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:16:56,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:16:57,055 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:16:57,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:16:57,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 10:16:57,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:16:57,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:16:57,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:16:57,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:16:57,073 INFO L87 Difference]: Start difference. First operand 367 states and 1844 transitions. Second operand 12 states. [2019-02-18 10:17:04,676 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-02-18 10:17:17,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:17:17,004 INFO L93 Difference]: Finished difference Result 685 states and 3436 transitions. [2019-02-18 10:17:17,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 10:17:17,004 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-02-18 10:17:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:17:17,006 INFO L225 Difference]: With dead ends: 685 [2019-02-18 10:17:17,006 INFO L226 Difference]: Without dead ends: 677 [2019-02-18 10:17:17,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-02-18 10:17:17,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-02-18 10:17:32,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 545. [2019-02-18 10:17:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-02-18 10:17:32,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 2791 transitions. [2019-02-18 10:17:32,232 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 2791 transitions. Word has length 9 [2019-02-18 10:17:32,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:17:32,233 INFO L480 AbstractCegarLoop]: Abstraction has 545 states and 2791 transitions. [2019-02-18 10:17:32,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:17:32,233 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 2791 transitions. [2019-02-18 10:17:32,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 10:17:32,234 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:17:32,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:17:32,234 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:17:32,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:17:32,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1616311456, now seen corresponding path program 2 times [2019-02-18 10:17:32,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:17:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:17:32,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:17:32,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:17:32,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:17:32,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:17:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:17:32,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:17:32,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:17:32,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:17:32,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:17:32,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:17:32,379 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:17:32,387 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:17:32,387 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:17:32,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 10:17:32,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:17:32,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:17:32,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:17:32,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:17:32,451 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:17:32,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,498 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,500 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:17:32,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:32,516 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:32,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:32,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:32,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:17:32,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:17:32,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:17:32,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:17:32,577 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:17:32,578 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:32,599 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:32,611 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:32,620 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:32,630 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:32,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:17:32,656 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:17:32,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-02-18 10:17:32,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:17:32,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:17:32,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:94 [2019-02-18 10:17:32,872 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,873 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,874 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,875 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,876 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,877 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:32,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-02-18 10:17:32,878 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:33,320 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,321 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,322 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,323 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,324 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:17:33,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 51 [2019-02-18 10:17:33,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:33,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:17:33,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:112, output treesize:86 [2019-02-18 10:17:33,425 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,426 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,427 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,428 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,429 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,430 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,431 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,432 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,433 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,434 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,435 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,436 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,437 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:17:33,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 99 [2019-02-18 10:17:33,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:33,505 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 45 [2019-02-18 10:17:33,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:33,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:17:33,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:106, output treesize:70 [2019-02-18 10:17:33,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,590 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,591 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,592 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,593 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2019-02-18 10:17:33,594 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:33,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,640 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,641 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,643 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,644 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,645 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,646 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,647 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,648 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,650 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:33,650 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:17:33,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 110 [2019-02-18 10:17:33,652 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:33,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:17:33,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:94, output treesize:66 [2019-02-18 10:17:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:17:33,763 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:17:33,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:17:33,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:17:33,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-18 10:17:33,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:17:33,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 10:17:33,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 10:17:33,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:17:33,838 INFO L87 Difference]: Start difference. First operand 545 states and 2791 transitions. Second operand 13 states. [2019-02-18 10:17:34,705 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-02-18 10:17:35,585 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-02-18 10:17:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:17:48,817 INFO L93 Difference]: Finished difference Result 550 states and 2805 transitions. [2019-02-18 10:17:48,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:17:48,818 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-18 10:17:48,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:17:48,819 INFO L225 Difference]: With dead ends: 550 [2019-02-18 10:17:48,819 INFO L226 Difference]: Without dead ends: 543 [2019-02-18 10:17:48,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2019-02-18 10:17:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-02-18 10:17:51,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 38. [2019-02-18 10:17:51,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 10:17:51,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-02-18 10:17:51,842 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 9 [2019-02-18 10:17:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:17:51,843 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-02-18 10:17:51,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 10:17:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-02-18 10:17:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 10:17:51,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:17:51,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:17:51,843 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:17:51,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:17:51,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1518781026, now seen corresponding path program 1 times [2019-02-18 10:17:51,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:17:51,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:17:51,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:17:51,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:17:51,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:17:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:17:51,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:17:51,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:17:51,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:17:51,927 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-18 10:17:51,927 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [30], [31] [2019-02-18 10:17:51,928 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:17:51,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:17:52,271 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:17:52,271 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:17:52,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:17:52,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:17:52,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:17:52,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:17:52,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:17:52,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:17:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:17:52,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:17:52,306 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-02-18 10:17:52,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,338 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-02-18 10:17:52,371 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,372 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,373 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,374 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,375 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-02-18 10:17:52,416 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,417 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,418 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,419 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,420 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,421 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:52,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-02-18 10:17:52,422 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:52,437 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:52,453 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:52,469 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:52,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:17:52,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2019-02-18 10:17:52,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 37 [2019-02-18 10:17:52,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-02-18 10:17:52,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2019-02-18 10:17:52,531 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:52,879 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:53,101 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:53,253 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:53,403 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:17:53,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:17:53,796 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:69, output treesize:66 [2019-02-18 10:17:54,167 WARN L181 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-02-18 10:17:54,209 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-02-18 10:17:54,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:54,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:17:54,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-02-18 10:17:54,307 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,308 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,309 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,310 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,311 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,312 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,313 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-02-18 10:17:54,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:54,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:17:54,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-02-18 10:17:54,377 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,378 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,379 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,381 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,382 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,383 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,384 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,385 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,386 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,387 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:17:54,388 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-02-18 10:17:54,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:54,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:17:54,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-02-18 10:17:54,452 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,453 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,454 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,455 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,456 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,457 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,459 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,460 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,461 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,462 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,463 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,464 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:17:54,465 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:17:54,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 96 [2019-02-18 10:17:54,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:17:54,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:17:54,499 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-02-18 10:17:55,021 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:17:55,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:17:55,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:17:55,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:17:55,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-18 10:17:55,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:17:55,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 10:17:55,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 10:17:55,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:17:55,118 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-02-18 10:18:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:18:01,236 INFO L93 Difference]: Finished difference Result 67 states and 277 transitions. [2019-02-18 10:18:01,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 10:18:01,236 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-18 10:18:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:18:01,237 INFO L225 Difference]: With dead ends: 67 [2019-02-18 10:18:01,237 INFO L226 Difference]: Without dead ends: 58 [2019-02-18 10:18:01,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2019-02-18 10:18:01,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-18 10:18:04,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2019-02-18 10:18:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-18 10:18:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 171 transitions. [2019-02-18 10:18:04,487 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 171 transitions. Word has length 10 [2019-02-18 10:18:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:18:04,487 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 171 transitions. [2019-02-18 10:18:04,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 10:18:04,487 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 171 transitions. [2019-02-18 10:18:04,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 10:18:04,488 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:18:04,488 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:18:04,488 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:18:04,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:18:04,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1744942188, now seen corresponding path program 1 times [2019-02-18 10:18:04,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:18:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:18:04,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:18:04,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:18:04,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:18:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:18:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-02-18 10:18:04,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:18:04,634 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:18:04,634 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-18 10:18:04,635 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [30], [31] [2019-02-18 10:18:04,635 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:18:04,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:18:04,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:18:04,967 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:18:04,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:18:04,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:18:04,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:18:04,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:18:04,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:18:04,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:18:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:18:04,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:18:04,985 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:18:04,998 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,001 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:18:05,031 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,033 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,035 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,036 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:18:05,075 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,077 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,079 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,080 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,081 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,082 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:18:05,083 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,098 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,112 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:18:05,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:18:05,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:18:05,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:18:05,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:18:05,159 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,180 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,192 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,201 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,211 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,237 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 2 variables, input treesize:61, output treesize:62 [2019-02-18 10:18:05,273 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-02-18 10:18:05,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,298 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:18:05,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:72, output treesize:46 [2019-02-18 10:18:05,329 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,330 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,331 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,332 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,335 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,336 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,337 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-02-18 10:18:05,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:18:05,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:18:05,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:58, output treesize:68 [2019-02-18 10:18:05,488 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,489 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,490 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,492 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,493 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,495 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,495 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:18:05,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 83 [2019-02-18 10:18:05,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,544 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,545 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,546 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,547 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,548 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,549 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,550 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,551 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,552 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,553 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,554 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,554 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:18:05,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 104 [2019-02-18 10:18:05,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-02-18 10:18:05,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:88, output treesize:64 [2019-02-18 10:18:05,654 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,655 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,656 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,657 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,658 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,659 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,661 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,662 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,663 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,664 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,665 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,666 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,666 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:18:05,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 109 [2019-02-18 10:18:05,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,722 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,724 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,725 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,726 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,727 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,728 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,729 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,730 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:05,732 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:18:05,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-02-18 10:18:05,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:05,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-02-18 10:18:05,773 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:84, output treesize:64 [2019-02-18 10:18:05,826 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:18:05,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:18:05,888 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:18:05,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:18:05,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 10:18:05,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:18:05,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-18 10:18:05,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-18 10:18:05,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-02-18 10:18:05,907 INFO L87 Difference]: Start difference. First operand 39 states and 171 transitions. Second operand 12 states. [2019-02-18 10:18:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:18:12,072 INFO L93 Difference]: Finished difference Result 74 states and 289 transitions. [2019-02-18 10:18:12,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 10:18:12,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 10 [2019-02-18 10:18:12,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:18:12,073 INFO L225 Difference]: With dead ends: 74 [2019-02-18 10:18:12,073 INFO L226 Difference]: Without dead ends: 59 [2019-02-18 10:18:12,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=348, Unknown=0, NotChecked=0, Total=506 [2019-02-18 10:18:12,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-18 10:18:15,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 38. [2019-02-18 10:18:15,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 10:18:15,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 166 transitions. [2019-02-18 10:18:15,728 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 166 transitions. Word has length 10 [2019-02-18 10:18:15,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:18:15,728 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 166 transitions. [2019-02-18 10:18:15,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-18 10:18:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 166 transitions. [2019-02-18 10:18:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-18 10:18:15,728 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:18:15,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:18:15,729 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:18:15,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:18:15,729 INFO L82 PathProgramCache]: Analyzing trace with hash 854957070, now seen corresponding path program 1 times [2019-02-18 10:18:15,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:18:15,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:18:15,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:18:15,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:18:15,729 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:18:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:18:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-02-18 10:18:15,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:18:15,874 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:18:15,874 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-02-18 10:18:15,875 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [30], [31] [2019-02-18 10:18:15,875 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 10:18:15,876 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 10:18:16,223 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 10:18:16,223 INFO L272 AbstractInterpreter]: Visited 10 different actions 15 times. Merged at 1 different actions 1 times. Never widened. Found 8 fixpoints after 5 different actions. Largest state had 0 variables. [2019-02-18 10:18:16,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:18:16,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 10:18:16,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:18:16,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:18:16,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:18:16,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:18:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:18:16,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:18:16,242 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-02-18 10:18:16,256 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,260 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-02-18 10:18:16,297 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,298 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,300 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,301 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-02-18 10:18:16,339 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,340 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,341 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,342 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,343 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,345 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-02-18 10:18:16,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,375 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,391 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:18:16,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:18:16,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 33 [2019-02-18 10:18:16,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 47 [2019-02-18 10:18:16,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 62 [2019-02-18 10:18:16,424 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,444 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,455 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,465 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,474 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:18:16,500 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:61, output treesize:62 [2019-02-18 10:18:16,543 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-02-18 10:18:16,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-18 10:18:16,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-02-18 10:18:16,585 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,586 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,587 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,588 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,589 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-02-18 10:18:16,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:18:16,609 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-02-18 10:18:16,632 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,633 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,634 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,635 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,636 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,637 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,638 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,638 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:18:16,639 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 76 [2019-02-18 10:18:16,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:18:16,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:25 [2019-02-18 10:18:16,681 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,683 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,684 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,685 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,686 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,687 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,688 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,689 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,690 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,691 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:16,692 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:18:16,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-02-18 10:18:16,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:16,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-02-18 10:18:16,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-02-18 10:18:16,737 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:18:16,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:18:16,774 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:18:16,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:18:16,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-02-18 10:18:16,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:18:16,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 10:18:16,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 10:18:16,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-02-18 10:18:16,792 INFO L87 Difference]: Start difference. First operand 38 states and 166 transitions. Second operand 13 states. [2019-02-18 10:18:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:18:23,963 INFO L93 Difference]: Finished difference Result 80 states and 341 transitions. [2019-02-18 10:18:23,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 10:18:23,963 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-02-18 10:18:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:18:23,964 INFO L225 Difference]: With dead ends: 80 [2019-02-18 10:18:23,964 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 10:18:23,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-02-18 10:18:23,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 10:18:30,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2019-02-18 10:18:30,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-18 10:18:30,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 296 transitions. [2019-02-18 10:18:30,311 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 296 transitions. Word has length 10 [2019-02-18 10:18:30,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:18:30,311 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 296 transitions. [2019-02-18 10:18:30,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 10:18:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 296 transitions. [2019-02-18 10:18:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-18 10:18:30,312 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:18:30,312 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-02-18 10:18:30,312 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:18:30,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:18:30,312 INFO L82 PathProgramCache]: Analyzing trace with hash 997631658, now seen corresponding path program 2 times [2019-02-18 10:18:30,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:18:30,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:18:30,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:18:30,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:18:30,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:18:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:18:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-02-18 10:18:30,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:18:30,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:18:30,444 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:18:30,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:18:30,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:18:30,444 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:18:30,454 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:18:30,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:18:30,460 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-18 10:18:30,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:18:30,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:18:30,464 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-02-18 10:18:30,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2019-02-18 10:18:30,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2019-02-18 10:18:30,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2019-02-18 10:18:30,491 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,494 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,496 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,497 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 42 [2019-02-18 10:18:30,498 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,514 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,532 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,555 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2019-02-18 10:18:30,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2019-02-18 10:18:30,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2019-02-18 10:18:30,575 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,576 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,577 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,581 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-02-18 10:18:30,581 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,588 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,595 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,602 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-02-18 10:18:30,618 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:36, output treesize:42 [2019-02-18 10:18:30,649 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2019-02-18 10:18:30,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-02-18 10:18:30,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-18 10:18:30,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:35 [2019-02-18 10:18:30,705 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,706 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,707 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 32 [2019-02-18 10:18:30,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,731 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,732 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,733 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,734 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,735 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2019-02-18 10:18:30,736 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-02-18 10:18:30,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:35 [2019-02-18 10:18:30,779 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,780 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,781 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,782 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,783 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,784 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,785 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,786 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,787 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 60 [2019-02-18 10:18:30,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,820 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,821 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,822 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,823 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-18 10:18:30,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-18 10:18:30,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:28 [2019-02-18 10:18:30,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,863 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,864 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,865 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-18 10:18:30,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,888 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,889 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,890 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,891 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,892 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,893 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,894 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,895 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,896 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2019-02-18 10:18:30,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-02-18 10:18:30,920 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2019-02-18 10:18:30,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,946 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,947 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,948 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,949 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,949 INFO L683 Elim1Store]: detected equality via solver [2019-02-18 10:18:30,950 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2019-02-18 10:18:30,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:30,978 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,979 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,980 INFO L701 Elim1Store]: detected not equals via solver [2019-02-18 10:18:30,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2019-02-18 10:18:30,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-18 10:18:31,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-02-18 10:18:31,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:54, output treesize:34 [2019-02-18 10:18:31,032 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:18:31,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:18:31,096 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:18:31,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:18:31,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-02-18 10:18:31,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:18:31,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 10:18:31,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 10:18:31,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2019-02-18 10:18:31,114 INFO L87 Difference]: Start difference. First operand 64 states and 296 transitions. Second operand 13 states. [2019-02-18 10:18:37,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:18:37,918 INFO L93 Difference]: Finished difference Result 71 states and 316 transitions. [2019-02-18 10:18:37,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 10:18:37,919 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 11 [2019-02-18 10:18:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:18:37,919 INFO L225 Difference]: With dead ends: 71 [2019-02-18 10:18:37,919 INFO L226 Difference]: Without dead ends: 0 [2019-02-18 10:18:37,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2019-02-18 10:18:37,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-18 10:18:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-18 10:18:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-18 10:18:37,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-18 10:18:37,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2019-02-18 10:18:37,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:18:37,920 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-18 10:18:37,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 10:18:37,921 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-18 10:18:37,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-18 10:18:37,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-18 10:18:38,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:18:38,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:18:38,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:18:41,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:18:50,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:18:50,173 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:18:50,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:18:50,204 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:18:50,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:18:50,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:19:10,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:19:10,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:19:35,551 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:19:47,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:19:48,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:19:49,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:19:50,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:19:56,166 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:20:01,676 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:20:05,677 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:20:21,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-02-18 10:20:21,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent.