java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:05:02,258 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:05:02,260 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:05:02,272 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:05:02,272 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:05:02,274 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:05:02,275 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:05:02,277 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:05:02,279 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:05:02,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:05:02,280 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:05:02,281 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:05:02,282 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:05:02,283 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:05:02,284 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:05:02,285 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:05:02,286 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:05:02,288 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:05:02,290 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:05:02,291 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:05:02,293 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:05:02,294 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:05:02,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:05:02,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:05:02,297 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:05:02,298 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:05:02,299 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:05:02,300 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:05:02,301 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:05:02,305 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:05:02,305 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:05:02,306 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:05:02,306 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:05:02,306 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:05:02,308 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:05:02,309 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:05:02,310 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-20 10:05:02,330 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:05:02,330 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:05:02,331 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:05:02,331 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:05:02,332 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:05:02,332 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:05:02,333 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:05:02,333 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:05:02,333 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 10:05:02,333 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:05:02,333 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 10:05:02,334 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 10:05:02,334 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:05:02,334 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:05:02,335 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:05:02,335 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:05:02,336 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:05:02,337 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:05:02,337 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:05:02,338 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:05:02,338 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:05:02,338 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:05:02,338 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:05:02,338 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:05:02,339 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:05:02,339 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:05:02,339 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:05:02,339 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:05:02,340 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:05:02,340 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:05:02,340 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:05:02,340 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:05:02,341 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:05:02,341 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:05:02,341 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:05:02,341 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:05:02,341 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:05:02,342 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:05:02,342 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:05:02,342 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:05:02,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:05:02,396 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:05:02,403 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:05:02,405 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:05:02,405 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:05:02,406 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl [2019-01-20 10:05:02,406 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-5-limited.bpl' [2019-01-20 10:05:02,452 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:05:02,454 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:05:02,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:05:02,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:05:02,455 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:05:02,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:05:02" (1/1) ... [2019-01-20 10:05:02,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:05:02" (1/1) ... [2019-01-20 10:05:02,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:05:02,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:05:02,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:05:02,517 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:05:02,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:05:02" (1/1) ... [2019-01-20 10:05:02,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:05:02" (1/1) ... [2019-01-20 10:05:02,530 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:05:02" (1/1) ... [2019-01-20 10:05:02,530 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:05:02" (1/1) ... [2019-01-20 10:05:02,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:05:02" (1/1) ... [2019-01-20 10:05:02,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:05:02" (1/1) ... [2019-01-20 10:05:02,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:05:02" (1/1) ... [2019-01-20 10:05:02,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:05:02,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:05:02,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:05:02,541 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:05:02,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:05:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:05:02,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:05:02,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:05:02,952 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:05:02,953 INFO L286 CfgBuilder]: Removed 13 assue(true) statements. [2019-01-20 10:05:02,954 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:05:02 BoogieIcfgContainer [2019-01-20 10:05:02,954 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:05:02,955 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:05:02,956 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:05:02,959 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:05:02,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:05:02" (1/2) ... [2019-01-20 10:05:02,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c919ea6 and model type speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:05:02, skipping insertion in model container [2019-01-20 10:05:02,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:05:02" (2/2) ... [2019-01-20 10:05:02,962 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-5-limited.bpl [2019-01-20 10:05:02,971 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:05:02,979 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-01-20 10:05:02,997 INFO L257 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-01-20 10:05:03,029 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:05:03,029 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:05:03,029 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:05:03,029 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:05:03,029 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:05:03,030 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:05:03,030 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:05:03,030 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:05:03,045 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states. [2019-01-20 10:05:03,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:05:03,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:03,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:05:03,055 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash 984, now seen corresponding path program 1 times [2019-01-20 10:05:03,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:03,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:03,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:03,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:03,118 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:03,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:03,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:05:03,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:05:03,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:05:03,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:05:03,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:05:03,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:05:03,256 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 3 states. [2019-01-20 10:05:03,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:03,572 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2019-01-20 10:05:03,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:05:03,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:05:03,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:03,594 INFO L225 Difference]: With dead ends: 25 [2019-01-20 10:05:03,594 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 10:05:03,599 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-01-20 10:05:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 10:05:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 12. [2019-01-20 10:05:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-20 10:05:03,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-01-20 10:05:03,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 21 transitions. Word has length 2 [2019-01-20 10:05:03,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:03,638 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 21 transitions. [2019-01-20 10:05:03,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:05:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 21 transitions. [2019-01-20 10:05:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:05:03,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:03,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:05:03,640 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash 30372, now seen corresponding path program 1 times [2019-01-20 10:05:03,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:03,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:03,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:03,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:03,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:03,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:03,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:03,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:03,794 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:05:03,796 INFO L207 CegarAbsIntRunner]: [0], [18], [23] [2019-01-20 10:05:03,851 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:03,852 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:03,917 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:03,919 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:05:03,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:03,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:03,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:03,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:03,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:03,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:03,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:04,007 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-01-20 10:05:04,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,028 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-01-20 10:05:04,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,097 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-01-20 10:05:04,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,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, 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-01-20 10:05:04,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,270 INFO L303 Elim1Store]: Index analysis took 105 ms [2019-01-20 10:05:04,275 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-01-20 10:05:04,277 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:04,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:04,463 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:04,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:04,556 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:04,669 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-01-20 10:05:04,670 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:04,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:04,847 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-01-20 10:05:04,848 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:04,908 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-01-20 10:05:04,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:04,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:04,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:05,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:05,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:05:05,067 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:05,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:05:05,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:05:05,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:05,069 INFO L87 Difference]: Start difference. First operand 12 states and 21 transitions. Second operand 6 states. [2019-01-20 10:05:05,200 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-01-20 10:05:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:05,799 INFO L93 Difference]: Finished difference Result 39 states and 56 transitions. [2019-01-20 10:05:05,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:05:05,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:05:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:05,801 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:05:05,802 INFO L226 Difference]: Without dead ends: 37 [2019-01-20 10:05:05,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:05:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-20 10:05:05,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 16. [2019-01-20 10:05:05,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 10:05:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 32 transitions. [2019-01-20 10:05:05,809 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 32 transitions. Word has length 3 [2019-01-20 10:05:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:05,809 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 32 transitions. [2019-01-20 10:05:05,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:05:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 32 transitions. [2019-01-20 10:05:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:05:05,810 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:05,810 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:05:05,811 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:05,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:05,811 INFO L82 PathProgramCache]: Analyzing trace with hash 30434, now seen corresponding path program 1 times [2019-01-20 10:05:05,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:05,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:05,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:05,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:05,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:05,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:05,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:05,922 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:05:05,922 INFO L207 CegarAbsIntRunner]: [0], [20], [23] [2019-01-20 10:05:05,924 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:05,924 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:05,933 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:05,933 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:05:05,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:05,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:05,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:05,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:05,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:05,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:05,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:05,964 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-01-20 10:05:05,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:05,975 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-01-20 10:05:06,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,004 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-01-20 10:05:06,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,019 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-01-20 10:05:06,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,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, 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-01-20 10:05:06,041 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:06,079 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:06,105 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:06,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:06,140 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:06,179 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-01-20 10:05:06,180 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:06,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,244 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-01-20 10:05:06,245 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:06,350 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-01-20 10:05:06,353 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:06,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:06,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:06,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:06,417 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:05:06,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-20 10:05:06,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:05:06,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:05:06,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:05:06,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:06,418 INFO L87 Difference]: Start difference. First operand 16 states and 32 transitions. Second operand 4 states. [2019-01-20 10:05:06,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:06,502 INFO L93 Difference]: Finished difference Result 18 states and 39 transitions. [2019-01-20 10:05:06,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:05:06,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:05:06,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:06,505 INFO L225 Difference]: With dead ends: 18 [2019-01-20 10:05:06,505 INFO L226 Difference]: Without dead ends: 17 [2019-01-20 10:05:06,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:06,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-20 10:05:06,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-20 10:05:06,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:05:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 38 transitions. [2019-01-20 10:05:06,510 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 38 transitions. Word has length 3 [2019-01-20 10:05:06,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:06,511 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 38 transitions. [2019-01-20 10:05:06,511 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:05:06,511 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 38 transitions. [2019-01-20 10:05:06,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:05:06,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:06,511 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:05:06,512 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:06,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:06,512 INFO L82 PathProgramCache]: Analyzing trace with hash 30560, now seen corresponding path program 1 times [2019-01-20 10:05:06,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:06,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:06,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:06,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:06,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:06,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:06,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:05:06,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:05:06,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:05:06,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:05:06,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:05:06,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:05:06,635 INFO L87 Difference]: Start difference. First operand 17 states and 38 transitions. Second operand 3 states. [2019-01-20 10:05:06,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:06,681 INFO L93 Difference]: Finished difference Result 21 states and 39 transitions. [2019-01-20 10:05:06,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:05:06,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:05:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:06,682 INFO L225 Difference]: With dead ends: 21 [2019-01-20 10:05:06,682 INFO L226 Difference]: Without dead ends: 20 [2019-01-20 10:05:06,682 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-01-20 10:05:06,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-20 10:05:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2019-01-20 10:05:06,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:05:06,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 37 transitions. [2019-01-20 10:05:06,687 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 37 transitions. Word has length 3 [2019-01-20 10:05:06,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:06,687 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 37 transitions. [2019-01-20 10:05:06,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:05:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 37 transitions. [2019-01-20 10:05:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:05:06,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:06,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:05:06,688 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:06,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash 30124, now seen corresponding path program 1 times [2019-01-20 10:05:06,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:06,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:06,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:06,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:06,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:06,810 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:06,811 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:05:06,811 INFO L207 CegarAbsIntRunner]: [0], [10], [23] [2019-01-20 10:05:06,813 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:06,813 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:06,820 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:06,820 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 62 root evaluator evaluations with a maximum evaluation depth of 3. Performed 62 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:05:06,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:06,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:06,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:06,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:06,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:06,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:06,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:06,844 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-01-20 10:05:06,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,848 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-01-20 10:05:06,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,859 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-01-20 10:05:06,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,887 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-01-20 10:05:06,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:06,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, 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-01-20 10:05:06,910 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:06,959 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:06,975 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:07,009 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:07,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:07,040 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-01-20 10:05:07,041 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:07,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,086 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-01-20 10:05:07,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:07,132 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-01-20 10:05:07,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:07,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:07,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:07,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:07,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:05:07,261 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:07,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:05:07,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:05:07,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:07,262 INFO L87 Difference]: Start difference. First operand 17 states and 37 transitions. Second operand 6 states. [2019-01-20 10:05:07,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:07,501 INFO L93 Difference]: Finished difference Result 39 states and 66 transitions. [2019-01-20 10:05:07,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:05:07,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:05:07,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:07,503 INFO L225 Difference]: With dead ends: 39 [2019-01-20 10:05:07,503 INFO L226 Difference]: Without dead ends: 38 [2019-01-20 10:05:07,503 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:05:07,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-20 10:05:07,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 18. [2019-01-20 10:05:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-20 10:05:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2019-01-20 10:05:07,509 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 43 transitions. Word has length 3 [2019-01-20 10:05:07,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:07,510 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 43 transitions. [2019-01-20 10:05:07,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:05:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 43 transitions. [2019-01-20 10:05:07,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:05:07,510 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:07,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:05:07,511 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:07,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:07,511 INFO L82 PathProgramCache]: Analyzing trace with hash 941462, now seen corresponding path program 1 times [2019-01-20 10:05:07,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:07,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:07,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:07,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:07,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:07,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:07,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:07,646 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:05:07,646 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [23] [2019-01-20 10:05:07,648 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:07,648 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:07,655 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:07,655 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:07,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:07,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:07,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:07,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:07,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:07,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:07,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:07,688 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-01-20 10:05:07,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,694 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-01-20 10:05:07,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,705 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-01-20 10:05:07,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,718 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-01-20 10:05:07,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,767 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-01-20 10:05:07,768 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:07,868 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:07,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:07,898 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:07,910 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:07,930 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-01-20 10:05:07,931 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:07,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:07,983 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-01-20 10:05:07,984 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:08,031 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-01-20 10:05:08,031 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:08,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:08,159 INFO L303 Elim1Store]: Index analysis took 107 ms [2019-01-20 10:05:08,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, 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-01-20 10:05:08,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:08,213 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-01-20 10:05:08,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:08,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:08,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:08,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:08,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:08,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:08,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:08,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:08,297 INFO L87 Difference]: Start difference. First operand 18 states and 43 transitions. Second operand 8 states. [2019-01-20 10:05:08,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:08,823 INFO L93 Difference]: Finished difference Result 49 states and 91 transitions. [2019-01-20 10:05:08,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:08,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:05:08,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:08,825 INFO L225 Difference]: With dead ends: 49 [2019-01-20 10:05:08,825 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 10:05:08,826 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-01-20 10:05:08,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 10:05:08,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2019-01-20 10:05:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-20 10:05:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 58 transitions. [2019-01-20 10:05:08,833 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 58 transitions. Word has length 4 [2019-01-20 10:05:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:08,833 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 58 transitions. [2019-01-20 10:05:08,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 58 transitions. [2019-01-20 10:05:08,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:05:08,834 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:08,834 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:05:08,834 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:08,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:08,834 INFO L82 PathProgramCache]: Analyzing trace with hash 941028, now seen corresponding path program 1 times [2019-01-20 10:05:08,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:08,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:08,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:08,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:08,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:08,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-01-20 10:05:08,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:08,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:08,992 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:05:08,992 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [23] [2019-01-20 10:05:08,995 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:08,995 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:09,009 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:09,009 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:09,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:09,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:09,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:09,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:09,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:09,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:09,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:09,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:09,042 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-01-20 10:05:09,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,047 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-01-20 10:05:09,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,058 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-01-20 10:05:09,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,070 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-01-20 10:05:09,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,084 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-01-20 10:05:09,085 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:09,117 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:09,130 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:09,142 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:09,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:09,171 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-01-20 10:05:09,172 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:09,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,259 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-01-20 10:05:09,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:09,313 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-01-20 10:05:09,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:09,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:09,406 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-01-20 10:05:09,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:09,508 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-01-20 10:05:09,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:09,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:09,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:09,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:09,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:09,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:05:09,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:09,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:09,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:09,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:05:09,591 INFO L87 Difference]: Start difference. First operand 22 states and 58 transitions. Second operand 8 states. [2019-01-20 10:05:10,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:10,236 INFO L93 Difference]: Finished difference Result 47 states and 98 transitions. [2019-01-20 10:05:10,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:05:10,237 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:05:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:10,237 INFO L225 Difference]: With dead ends: 47 [2019-01-20 10:05:10,238 INFO L226 Difference]: Without dead ends: 46 [2019-01-20 10:05:10,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-20 10:05:10,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2019-01-20 10:05:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-20 10:05:10,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 70 transitions. [2019-01-20 10:05:10,246 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 70 transitions. Word has length 4 [2019-01-20 10:05:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:10,246 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 70 transitions. [2019-01-20 10:05:10,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:10,246 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 70 transitions. [2019-01-20 10:05:10,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:05:10,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:10,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:05:10,247 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:10,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:10,247 INFO L82 PathProgramCache]: Analyzing trace with hash 941588, now seen corresponding path program 1 times [2019-01-20 10:05:10,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:10,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:10,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:10,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:10,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:10,335 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:10,336 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:05:10,336 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [25] [2019-01-20 10:05:10,337 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:10,337 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:10,347 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:10,347 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:05:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:10,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:10,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:10,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:10,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:10,363 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:10,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:10,376 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-01-20 10:05:10,380 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-01-20 10:05:10,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:10,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,406 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:10,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,436 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-01-20 10:05:10,437 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:10,456 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:10,472 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:10,481 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:10,492 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:10,509 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-01-20 10:05:10,510 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:10,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,549 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-01-20 10:05:10,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:10,576 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-01-20 10:05:10,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:10,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:10,596 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:10,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:05:10,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-20 10:05:10,627 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:05:10,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:05:10,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:05:10,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:10,628 INFO L87 Difference]: Start difference. First operand 24 states and 70 transitions. Second operand 4 states. [2019-01-20 10:05:10,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:10,679 INFO L93 Difference]: Finished difference Result 28 states and 79 transitions. [2019-01-20 10:05:10,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:05:10,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:05:10,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:10,680 INFO L225 Difference]: With dead ends: 28 [2019-01-20 10:05:10,680 INFO L226 Difference]: Without dead ends: 27 [2019-01-20 10:05:10,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:10,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-20 10:05:10,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-01-20 10:05:10,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 10:05:10,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2019-01-20 10:05:10,687 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 77 transitions. Word has length 4 [2019-01-20 10:05:10,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:10,688 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 77 transitions. [2019-01-20 10:05:10,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:05:10,688 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 77 transitions. [2019-01-20 10:05:10,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:05:10,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:10,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:05:10,689 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:10,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:10,689 INFO L82 PathProgramCache]: Analyzing trace with hash 941152, now seen corresponding path program 1 times [2019-01-20 10:05:10,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:10,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:10,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:10,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:10,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:10,840 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-20 10:05:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:10,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:10,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:10,867 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:05:10,868 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [23] [2019-01-20 10:05:10,869 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:10,869 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:10,876 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:10,876 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:10,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:10,877 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:10,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:10,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:10,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:10,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:10,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:10,900 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:10,903 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-01-20 10:05:10,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,913 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-01-20 10:05:10,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,922 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-01-20 10:05:10,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,932 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-01-20 10:05:10,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:10,944 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-01-20 10:05:10,945 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:10,979 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:10,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:11,005 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:11,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:11,033 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-01-20 10:05:11,034 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:11,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,073 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-01-20 10:05:11,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:11,114 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-01-20 10:05:11,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:11,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,194 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:11,196 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-01-20 10:05:11,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:11,240 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-01-20 10:05:11,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:05:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:11,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:11,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:11,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:11,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:11,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:11,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:11,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:11,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:11,319 INFO L87 Difference]: Start difference. First operand 26 states and 77 transitions. Second operand 8 states. [2019-01-20 10:05:11,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:11,758 INFO L93 Difference]: Finished difference Result 44 states and 95 transitions. [2019-01-20 10:05:11,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:11,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:05:11,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:11,759 INFO L225 Difference]: With dead ends: 44 [2019-01-20 10:05:11,760 INFO L226 Difference]: Without dead ends: 43 [2019-01-20 10:05:11,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:05:11,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-20 10:05:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 25. [2019-01-20 10:05:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 10:05:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 70 transitions. [2019-01-20 10:05:11,768 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 70 transitions. Word has length 4 [2019-01-20 10:05:11,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:11,768 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 70 transitions. [2019-01-20 10:05:11,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:11,768 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 70 transitions. [2019-01-20 10:05:11,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:05:11,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:11,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:05:11,769 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:11,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:11,769 INFO L82 PathProgramCache]: Analyzing trace with hash 943510, now seen corresponding path program 1 times [2019-01-20 10:05:11,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:11,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:11,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:11,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:11,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:11,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:11,822 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:11,822 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:05:11,822 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [25] [2019-01-20 10:05:11,825 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:11,825 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:11,829 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:11,830 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:05:11,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:11,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:11,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:11,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:11,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:11,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:11,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:11,861 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-01-20 10:05:11,900 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-01-20 10:05:11,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:11,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,942 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:11,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:11,957 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-01-20 10:05:11,958 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:11,976 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:11,988 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:11,999 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:12,009 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:12,026 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-01-20 10:05:12,026 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:12,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,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, 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-01-20 10:05:12,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:12,120 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-01-20 10:05:12,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:12,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:12,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:12,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:12,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:12,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:05:12,170 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:12,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:05:12,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:05:12,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:12,171 INFO L87 Difference]: Start difference. First operand 25 states and 70 transitions. Second operand 6 states. [2019-01-20 10:05:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:12,388 INFO L93 Difference]: Finished difference Result 43 states and 96 transitions. [2019-01-20 10:05:12,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:05:12,389 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:05:12,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:12,390 INFO L225 Difference]: With dead ends: 43 [2019-01-20 10:05:12,390 INFO L226 Difference]: Without dead ends: 42 [2019-01-20 10:05:12,391 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-01-20 10:05:12,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-20 10:05:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 26. [2019-01-20 10:05:12,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-20 10:05:12,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 76 transitions. [2019-01-20 10:05:12,399 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 76 transitions. Word has length 4 [2019-01-20 10:05:12,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:12,400 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 76 transitions. [2019-01-20 10:05:12,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:05:12,400 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 76 transitions. [2019-01-20 10:05:12,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:05:12,401 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:12,401 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:05:12,401 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:12,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:12,401 INFO L82 PathProgramCache]: Analyzing trace with hash 943074, now seen corresponding path program 1 times [2019-01-20 10:05:12,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:12,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:12,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:12,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:12,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:12,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:12,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:12,514 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:05:12,514 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [23] [2019-01-20 10:05:12,515 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:12,516 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:12,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:12,521 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:12,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:12,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:12,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:12,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:12,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:12,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:12,559 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-01-20 10:05:12,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,566 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-01-20 10:05:12,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,588 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-01-20 10:05:12,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,608 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-01-20 10:05:12,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,622 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-01-20 10:05:12,623 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:12,668 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:12,684 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:12,695 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:12,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:12,737 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-01-20 10:05:12,737 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:12,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,771 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-01-20 10:05:12,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:12,819 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-01-20 10:05:12,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:12,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:12,918 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-01-20 10:05:12,919 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:12,968 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-01-20 10:05:12,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:12,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:13,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:13,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:13,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:13,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:13,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:13,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:13,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:13,036 INFO L87 Difference]: Start difference. First operand 26 states and 76 transitions. Second operand 8 states. [2019-01-20 10:05:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:13,453 INFO L93 Difference]: Finished difference Result 56 states and 123 transitions. [2019-01-20 10:05:13,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:13,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:05:13,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:13,455 INFO L225 Difference]: With dead ends: 56 [2019-01-20 10:05:13,455 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:05:13,456 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-01-20 10:05:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:05:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2019-01-20 10:05:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-20 10:05:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2019-01-20 10:05:13,465 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 88 transitions. Word has length 4 [2019-01-20 10:05:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:13,465 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 88 transitions. [2019-01-20 10:05:13,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 88 transitions. [2019-01-20 10:05:13,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:05:13,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:13,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:05:13,466 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:13,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:13,466 INFO L82 PathProgramCache]: Analyzing trace with hash 929868, now seen corresponding path program 2 times [2019-01-20 10:05:13,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:13,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:13,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:13,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:13,468 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:13,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:13,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:13,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:13,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:13,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:13,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:13,553 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:13,561 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:05:13,562 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:05:13,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:05:13,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:13,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:13,582 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-01-20 10:05:13,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,586 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-01-20 10:05:13,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,594 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-01-20 10:05:13,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,605 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-01-20 10:05:13,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,618 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-01-20 10:05:13,618 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:13,643 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:13,659 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:13,672 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:13,691 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:13,806 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-01-20 10:05:13,807 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:13,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,856 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-01-20 10:05:13,857 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:13,902 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-01-20 10:05:13,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:13,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:13,938 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-01-20 10:05:13,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:13,989 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-01-20 10:05:13,989 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:14,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:14,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:14,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:05:14,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:14,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:14,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:14,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:05:14,105 INFO L87 Difference]: Start difference. First operand 28 states and 88 transitions. Second operand 8 states. [2019-01-20 10:05:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:14,473 INFO L93 Difference]: Finished difference Result 66 states and 142 transitions. [2019-01-20 10:05:14,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:05:14,474 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:05:14,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:14,475 INFO L225 Difference]: With dead ends: 66 [2019-01-20 10:05:14,475 INFO L226 Difference]: Without dead ends: 64 [2019-01-20 10:05:14,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:14,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-20 10:05:14,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 32. [2019-01-20 10:05:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:05:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 99 transitions. [2019-01-20 10:05:14,485 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 99 transitions. Word has length 4 [2019-01-20 10:05:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:14,485 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 99 transitions. [2019-01-20 10:05:14,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:14,485 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 99 transitions. [2019-01-20 10:05:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:05:14,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:14,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:05:14,486 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:14,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:14,487 INFO L82 PathProgramCache]: Analyzing trace with hash 930056, now seen corresponding path program 1 times [2019-01-20 10:05:14,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:14,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:14,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:14,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:14,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:14,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:14,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:14,570 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:05:14,570 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [25] [2019-01-20 10:05:14,570 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:14,570 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:14,576 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:14,576 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:05:14,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:14,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:14,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:14,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:14,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:14,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:14,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:14,606 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-01-20 10:05:14,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,613 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-01-20 10:05:14,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,625 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-01-20 10:05:14,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,633 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-01-20 10:05:14,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,647 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-01-20 10:05:14,647 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:14,688 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:14,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:14,730 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:14,742 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:14,768 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-01-20 10:05:14,768 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:14,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:14,820 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-01-20 10:05:14,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:14,868 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-01-20 10:05:14,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:14,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:14,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:14,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:05:14,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:14,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:05:14,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:05:14,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:14,929 INFO L87 Difference]: Start difference. First operand 32 states and 99 transitions. Second operand 6 states. [2019-01-20 10:05:15,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:15,120 INFO L93 Difference]: Finished difference Result 45 states and 113 transitions. [2019-01-20 10:05:15,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:05:15,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:05:15,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:15,121 INFO L225 Difference]: With dead ends: 45 [2019-01-20 10:05:15,122 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 10:05:15,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-01-20 10:05:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 10:05:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-01-20 10:05:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-20 10:05:15,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 104 transitions. [2019-01-20 10:05:15,132 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 104 transitions. Word has length 4 [2019-01-20 10:05:15,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:15,132 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 104 transitions. [2019-01-20 10:05:15,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:05:15,132 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 104 transitions. [2019-01-20 10:05:15,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:05:15,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:15,133 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:05:15,133 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:15,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:15,134 INFO L82 PathProgramCache]: Analyzing trace with hash 947418, now seen corresponding path program 1 times [2019-01-20 10:05:15,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:15,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:15,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:15,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:15,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:15,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:05:15,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:05:15,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:05:15,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:05:15,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:05:15,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:05:15,162 INFO L87 Difference]: Start difference. First operand 33 states and 104 transitions. Second operand 3 states. [2019-01-20 10:05:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:15,228 INFO L93 Difference]: Finished difference Result 34 states and 104 transitions. [2019-01-20 10:05:15,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:05:15,229 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-20 10:05:15,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:15,229 INFO L225 Difference]: With dead ends: 34 [2019-01-20 10:05:15,229 INFO L226 Difference]: Without dead ends: 31 [2019-01-20 10:05:15,230 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-01-20 10:05:15,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-20 10:05:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-20 10:05:15,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-20 10:05:15,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 101 transitions. [2019-01-20 10:05:15,244 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 101 transitions. Word has length 4 [2019-01-20 10:05:15,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:15,244 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 101 transitions. [2019-01-20 10:05:15,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:05:15,245 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 101 transitions. [2019-01-20 10:05:15,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:05:15,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:15,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:05:15,245 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:15,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:15,246 INFO L82 PathProgramCache]: Analyzing trace with hash 933340, now seen corresponding path program 1 times [2019-01-20 10:05:15,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:15,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:15,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:15,247 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:15,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:15,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:15,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:15,351 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:05:15,351 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [23] [2019-01-20 10:05:15,352 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:15,352 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:15,362 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:15,363 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:15,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:15,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:15,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:15,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:15,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:15,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:15,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:15,387 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-01-20 10:05:15,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,392 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-01-20 10:05:15,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,399 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-01-20 10:05:15,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2019-01-20 10:05:15,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,439 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-01-20 10:05:15,440 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:15,467 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:15,482 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:15,494 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:15,504 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:15,524 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-01-20 10:05:15,524 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:15,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,553 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-01-20 10:05:15,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:15,612 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-01-20 10:05:15,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:15,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:15,649 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-01-20 10:05:15,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:15,695 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-01-20 10:05:15,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:15,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:15,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:15,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:15,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:05:15,757 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:15,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:15,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:15,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:05:15,758 INFO L87 Difference]: Start difference. First operand 31 states and 101 transitions. Second operand 8 states. [2019-01-20 10:05:16,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:16,115 INFO L93 Difference]: Finished difference Result 59 states and 152 transitions. [2019-01-20 10:05:16,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:05:16,116 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:05:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:16,117 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:05:16,117 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 10:05:16,118 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-01-20 10:05:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 10:05:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 34. [2019-01-20 10:05:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-20 10:05:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 119 transitions. [2019-01-20 10:05:16,127 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 119 transitions. Word has length 4 [2019-01-20 10:05:16,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:16,127 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 119 transitions. [2019-01-20 10:05:16,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:16,127 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 119 transitions. [2019-01-20 10:05:16,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:05:16,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:16,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:05:16,128 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:16,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:16,129 INFO L82 PathProgramCache]: Analyzing trace with hash 937744, now seen corresponding path program 1 times [2019-01-20 10:05:16,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:16,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:16,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:16,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:16,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:16,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:16,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:16,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:16,202 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:05:16,202 INFO L207 CegarAbsIntRunner]: [0], [14], [24], [25] [2019-01-20 10:05:16,203 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:16,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:16,209 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:16,210 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:05:16,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:16,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:16,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:16,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:16,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:16,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:16,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:16,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:16,231 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-01-20 10:05:16,236 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-01-20 10:05:16,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:16,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,261 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:16,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,275 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-01-20 10:05:16,275 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:16,294 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:16,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:16,315 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:16,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:16,342 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-01-20 10:05:16,343 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:16,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:16,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 51 [2019-01-20 10:05:16,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:16,414 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-01-20 10:05:16,414 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:16,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:16,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:16,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:05:16,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:16,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:05:16,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:05:16,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:16,458 INFO L87 Difference]: Start difference. First operand 34 states and 119 transitions. Second operand 6 states. [2019-01-20 10:05:16,858 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-20 10:05:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:16,972 INFO L93 Difference]: Finished difference Result 51 states and 145 transitions. [2019-01-20 10:05:16,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:05:16,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:05:16,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:16,973 INFO L225 Difference]: With dead ends: 51 [2019-01-20 10:05:16,974 INFO L226 Difference]: Without dead ends: 50 [2019-01-20 10:05:16,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-01-20 10:05:16,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-20 10:05:16,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2019-01-20 10:05:16,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-20 10:05:16,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 125 transitions. [2019-01-20 10:05:16,984 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 125 transitions. Word has length 4 [2019-01-20 10:05:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:16,985 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 125 transitions. [2019-01-20 10:05:16,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:05:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 125 transitions. [2019-01-20 10:05:16,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:05:16,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:16,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:05:16,986 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:16,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:16,986 INFO L82 PathProgramCache]: Analyzing trace with hash 937308, now seen corresponding path program 1 times [2019-01-20 10:05:16,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:16,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:16,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:16,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:16,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:17,125 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:17,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:17,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:17,126 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:05:17,126 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [23] [2019-01-20 10:05:17,128 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:17,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:17,134 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:17,134 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 3. Performed 64 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:17,134 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:17,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:17,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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:17,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:17,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:17,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:17,158 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-01-20 10:05:17,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,164 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-01-20 10:05:17,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,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 23 treesize of output 37 [2019-01-20 10:05:17,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,188 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-01-20 10:05:17,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,223 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-01-20 10:05:17,224 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:17,253 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:17,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:17,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:17,291 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:17,310 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-01-20 10:05:17,311 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:17,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,370 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-01-20 10:05:17,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:17,420 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-01-20 10:05:17,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:17,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:17,465 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-01-20 10:05:17,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:17,874 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-01-20 10:05:17,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:17,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-01-20 10:05:17,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:17,934 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:17,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:17,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:17,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:17,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:17,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:17,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:17,956 INFO L87 Difference]: Start difference. First operand 35 states and 125 transitions. Second operand 8 states. [2019-01-20 10:05:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:18,451 INFO L93 Difference]: Finished difference Result 64 states and 172 transitions. [2019-01-20 10:05:18,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:18,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:05:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:18,453 INFO L225 Difference]: With dead ends: 64 [2019-01-20 10:05:18,453 INFO L226 Difference]: Without dead ends: 63 [2019-01-20 10:05:18,453 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-01-20 10:05:18,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-20 10:05:18,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 37. [2019-01-20 10:05:18,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 10:05:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-20 10:05:18,462 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 4 [2019-01-20 10:05:18,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:18,462 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-20 10:05:18,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-20 10:05:18,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:18,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:18,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:18,463 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:18,463 INFO L82 PathProgramCache]: Analyzing trace with hash 29185378, now seen corresponding path program 1 times [2019-01-20 10:05:18,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:18,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:18,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:18,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:18,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:18,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:18,575 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:18,575 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [25] [2019-01-20 10:05:18,576 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:18,576 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:18,580 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:18,580 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:18,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:18,581 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:18,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:18,581 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:18,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:18,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:18,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:18,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-01-20 10:05:18,603 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-01-20 10:05:18,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:18,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:18,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,657 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-01-20 10:05:18,657 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:18,696 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:18,708 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:18,718 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:18,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:18,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-01-20 10:05:18,745 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:18,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,815 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-01-20 10:05:18,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:18,847 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-01-20 10:05:18,848 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:18,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:18,874 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-01-20 10:05:18,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:18,923 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-01-20 10:05:18,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:05:18,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:18,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:18,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:18,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:18,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:18,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:18,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:18,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:18,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:18,983 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-20 10:05:19,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:19,294 INFO L93 Difference]: Finished difference Result 57 states and 164 transitions. [2019-01-20 10:05:19,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:19,294 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:05:19,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:19,295 INFO L225 Difference]: With dead ends: 57 [2019-01-20 10:05:19,296 INFO L226 Difference]: Without dead ends: 56 [2019-01-20 10:05:19,296 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-01-20 10:05:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-20 10:05:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2019-01-20 10:05:19,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:05:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 143 transitions. [2019-01-20 10:05:19,305 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 143 transitions. Word has length 5 [2019-01-20 10:05:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:19,305 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 143 transitions. [2019-01-20 10:05:19,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 143 transitions. [2019-01-20 10:05:19,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:19,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:19,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:19,307 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:19,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:19,307 INFO L82 PathProgramCache]: Analyzing trace with hash 29184942, now seen corresponding path program 1 times [2019-01-20 10:05:19,307 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:19,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:19,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:19,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:19,308 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:19,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:19,460 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:19,460 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:19,461 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [23] [2019-01-20 10:05:19,462 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:19,462 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:19,466 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:19,466 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:05:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:19,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:19,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:19,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:19,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:19,476 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:19,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:19,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 18 treesize of output 21 [2019-01-20 10:05:19,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,496 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-01-20 10:05:19,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,502 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-01-20 10:05:19,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,589 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-01-20 10:05:19,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,701 INFO L303 Elim1Store]: Index analysis took 110 ms [2019-01-20 10:05:19,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, 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-01-20 10:05:19,703 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:19,836 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:19,853 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:19,865 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:19,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:19,903 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-01-20 10:05:19,904 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:19,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:19,966 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-01-20 10:05:19,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:20,013 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-01-20 10:05:20,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:20,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,052 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-01-20 10:05:20,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:20,094 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-01-20 10:05:20,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:20,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,132 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:20,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:20,135 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-01-20 10:05:20,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:20,188 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-01-20 10:05:20,189 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:05:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:20,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:20,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:20,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:05:20,288 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:20,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:05:20,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:05:20,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:05:20,289 INFO L87 Difference]: Start difference. First operand 38 states and 143 transitions. Second operand 10 states. [2019-01-20 10:05:21,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:21,328 INFO L93 Difference]: Finished difference Result 68 states and 184 transitions. [2019-01-20 10:05:21,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:05:21,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:05:21,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:21,330 INFO L225 Difference]: With dead ends: 68 [2019-01-20 10:05:21,330 INFO L226 Difference]: Without dead ends: 67 [2019-01-20 10:05:21,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:05:21,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-20 10:05:21,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-01-20 10:05:21,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 10:05:21,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-20 10:05:21,350 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-20 10:05:21,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:21,350 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-20 10:05:21,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:05:21,350 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-20 10:05:21,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:21,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:21,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:21,354 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:21,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:21,354 INFO L82 PathProgramCache]: Analyzing trace with hash 29171924, now seen corresponding path program 1 times [2019-01-20 10:05:21,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:21,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:21,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:21,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:21,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:21,700 WARN L181 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-20 10:05:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:21,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:21,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:21,731 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:21,731 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [25] [2019-01-20 10:05:21,734 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:21,734 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:21,737 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:21,737 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:21,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:21,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:21,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:21,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:21,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:21,752 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:21,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:21,760 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-01-20 10:05:21,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,764 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-01-20 10:05:21,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,773 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-01-20 10:05:21,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,780 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-01-20 10:05:21,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,872 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-01-20 10:05:21,872 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:21,900 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:21,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:21,927 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:21,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:21,956 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-01-20 10:05:21,956 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:21,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:21,991 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-01-20 10:05:21,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:22,031 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-01-20 10:05:22,032 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:22,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,064 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-01-20 10:05:22,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:22,114 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-01-20 10:05:22,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:22,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:22,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:22,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:22,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:22,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:22,177 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:22,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:22,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:22,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:22,178 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 8 states. [2019-01-20 10:05:22,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:22,550 INFO L93 Difference]: Finished difference Result 56 states and 158 transitions. [2019-01-20 10:05:22,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:22,551 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:05:22,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:22,551 INFO L225 Difference]: With dead ends: 56 [2019-01-20 10:05:22,551 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:05:22,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:05:22,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:05:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 37. [2019-01-20 10:05:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-20 10:05:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 137 transitions. [2019-01-20 10:05:22,563 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 137 transitions. Word has length 5 [2019-01-20 10:05:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:22,563 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 137 transitions. [2019-01-20 10:05:22,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 137 transitions. [2019-01-20 10:05:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:22,564 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:22,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:22,565 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:22,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:22,565 INFO L82 PathProgramCache]: Analyzing trace with hash 29189286, now seen corresponding path program 1 times [2019-01-20 10:05:22,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:22,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:22,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:22,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:22,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:22,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:22,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:22,636 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:22,637 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [26], [27] [2019-01-20 10:05:22,638 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:22,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:22,642 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:22,642 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:05:22,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:22,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:22,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:22,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:22,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:22,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:22,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:22,662 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-01-20 10:05:22,668 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-01-20 10:05:22,674 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-01-20 10:05:22,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-20 10:05:22,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-20 10:05:22,693 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:22,706 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:22,716 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:22,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:22,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:22,751 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-01-20 10:05:22,751 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-20 10:05:22,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:22,786 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-01-20 10:05:22,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:22,802 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-01-20 10:05:22,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:05:22,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:22,815 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:22,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:22,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:05:22,911 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:22,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:05:22,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:05:22,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:22,912 INFO L87 Difference]: Start difference. First operand 37 states and 137 transitions. Second operand 6 states. [2019-01-20 10:05:23,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:23,035 INFO L93 Difference]: Finished difference Result 45 states and 143 transitions. [2019-01-20 10:05:23,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:05:23,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-20 10:05:23,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:23,036 INFO L225 Difference]: With dead ends: 45 [2019-01-20 10:05:23,036 INFO L226 Difference]: Without dead ends: 44 [2019-01-20 10:05:23,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-01-20 10:05:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-20 10:05:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2019-01-20 10:05:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-20 10:05:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 138 transitions. [2019-01-20 10:05:23,045 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 138 transitions. Word has length 5 [2019-01-20 10:05:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:23,045 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 138 transitions. [2019-01-20 10:05:23,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:05:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 138 transitions. [2019-01-20 10:05:23,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:23,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:23,046 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:23,046 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:23,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:23,047 INFO L82 PathProgramCache]: Analyzing trace with hash 29175208, now seen corresponding path program 1 times [2019-01-20 10:05:23,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:23,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:23,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:23,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:23,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:23,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:23,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:23,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:23,138 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:23,139 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [23] [2019-01-20 10:05:23,140 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:23,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:23,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:23,143 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:05:23,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:23,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:23,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:23,144 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:23,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:23,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:23,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:23,162 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-01-20 10:05:23,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,166 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-01-20 10:05:23,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,174 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-01-20 10:05:23,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,186 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-01-20 10:05:23,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,202 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-01-20 10:05:23,203 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:23,233 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:23,248 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:23,259 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:23,270 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:23,288 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-01-20 10:05:23,288 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:23,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,330 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-01-20 10:05:23,330 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:23,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-01-20 10:05:23,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:23,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,406 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:23,407 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-01-20 10:05:23,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:23,453 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-01-20 10:05:23,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:05:23,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:23,498 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 90 [2019-01-20 10:05:23,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:23,545 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-01-20 10:05:23,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:05:23,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:23,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:23,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:23,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:23,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:05:23,626 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:23,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:05:23,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:05:23,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:05:23,627 INFO L87 Difference]: Start difference. First operand 39 states and 138 transitions. Second operand 10 states. [2019-01-20 10:05:24,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:24,247 INFO L93 Difference]: Finished difference Result 71 states and 207 transitions. [2019-01-20 10:05:24,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:05:24,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:05:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:24,251 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:05:24,251 INFO L226 Difference]: Without dead ends: 70 [2019-01-20 10:05:24,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:05:24,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-20 10:05:24,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2019-01-20 10:05:24,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 10:05:24,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 144 transitions. [2019-01-20 10:05:24,264 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 144 transitions. Word has length 5 [2019-01-20 10:05:24,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:24,265 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 144 transitions. [2019-01-20 10:05:24,265 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:05:24,265 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 144 transitions. [2019-01-20 10:05:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:24,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:24,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:24,266 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:24,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:24,266 INFO L82 PathProgramCache]: Analyzing trace with hash 29179612, now seen corresponding path program 1 times [2019-01-20 10:05:24,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:24,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:24,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:24,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:24,268 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:24,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:24,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:24,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:24,363 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:24,363 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [25] [2019-01-20 10:05:24,366 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:24,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:24,370 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:24,370 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:24,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:24,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:24,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:24,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:24,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:24,382 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:24,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:24,391 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-01-20 10:05:24,399 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-01-20 10:05:24,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:24,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,422 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:24,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,432 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-01-20 10:05:24,432 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:24,452 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:24,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:24,474 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:24,484 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:24,500 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-01-20 10:05:24,501 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:24,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,548 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-01-20 10:05:24,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:24,574 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-01-20 10:05:24,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:24,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:24,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 67 [2019-01-20 10:05:24,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:24,727 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-01-20 10:05:24,728 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:05:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:24,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:24,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:24,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:24,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:24,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:24,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:24,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:24,786 INFO L87 Difference]: Start difference. First operand 40 states and 144 transitions. Second operand 8 states. [2019-01-20 10:05:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:25,170 INFO L93 Difference]: Finished difference Result 59 states and 171 transitions. [2019-01-20 10:05:25,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:25,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:05:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:25,171 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:05:25,171 INFO L226 Difference]: Without dead ends: 58 [2019-01-20 10:05:25,172 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-01-20 10:05:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-20 10:05:25,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2019-01-20 10:05:25,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:05:25,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-20 10:05:25,182 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-20 10:05:25,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:25,182 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-20 10:05:25,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:25,183 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-20 10:05:25,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:25,183 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:25,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:25,183 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:25,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:25,184 INFO L82 PathProgramCache]: Analyzing trace with hash 29179176, now seen corresponding path program 1 times [2019-01-20 10:05:25,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:25,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:25,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:25,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:25,185 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:25,327 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 21 [2019-01-20 10:05:25,559 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 17 [2019-01-20 10:05:25,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-01-20 10:05:25,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:25,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:25,588 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:25,588 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [23] [2019-01-20 10:05:25,589 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:25,589 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:25,594 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:25,594 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:05:25,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:25,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:25,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:25,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:25,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:25,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:25,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:25,611 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-01-20 10:05:25,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,624 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-01-20 10:05:25,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,629 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-01-20 10:05:25,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,635 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-01-20 10:05:25,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,646 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-01-20 10:05:25,646 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:25,674 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:25,689 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:25,701 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:25,712 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:25,730 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-01-20 10:05:25,730 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:25,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,769 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-01-20 10:05:25,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:25,828 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-01-20 10:05:25,829 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:25,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,867 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-01-20 10:05:25,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:25,914 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-01-20 10:05:25,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:25,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:25,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:26,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:26,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:26,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:26,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:26,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:26,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:26,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:26,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:26,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:26,009 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:26,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05: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, 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-01-20 10:05:26,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:26,087 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-01-20 10:05:26,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:05:26,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:26,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:26,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:26,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:05:26,176 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:26,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:05:26,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:05:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:05:26,177 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-20 10:05:26,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:26,920 INFO L93 Difference]: Finished difference Result 71 states and 197 transitions. [2019-01-20 10:05:26,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:05:26,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:05:26,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:26,922 INFO L225 Difference]: With dead ends: 71 [2019-01-20 10:05:26,922 INFO L226 Difference]: Without dead ends: 70 [2019-01-20 10:05:26,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:05:26,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-20 10:05:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 38. [2019-01-20 10:05:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-20 10:05:26,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 132 transitions. [2019-01-20 10:05:26,933 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 132 transitions. Word has length 5 [2019-01-20 10:05:26,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:26,933 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 132 transitions. [2019-01-20 10:05:26,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:05:26,933 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 132 transitions. [2019-01-20 10:05:26,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:26,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:26,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:26,934 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:26,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:26,935 INFO L82 PathProgramCache]: Analyzing trace with hash 29231506, now seen corresponding path program 1 times [2019-01-20 10:05:26,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:26,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:26,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:26,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:26,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:05:27,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:27,029 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:27,030 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:27,030 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [25] [2019-01-20 10:05:27,032 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:27,032 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:27,036 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:27,036 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:27,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:27,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:27,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:27,037 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:27,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:27,047 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:27,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:27,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:27,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:05:27,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,066 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-01-20 10:05:27,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,129 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-01-20 10:05:27,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,141 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-01-20 10:05:27,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,150 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-01-20 10:05:27,151 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:27,178 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:27,193 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:27,205 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:27,215 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:27,234 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-01-20 10:05:27,234 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:27,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,270 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-01-20 10:05:27,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:27,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-01-20 10:05:27,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:27,497 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-20 10:05:27,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:27,806 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:27,806 INFO L303 Elim1Store]: Index analysis took 305 ms [2019-01-20 10:05:27,807 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-01-20 10:05:27,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:28,349 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-01-20 10:05:28,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:28,532 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:29,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:29,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:29,006 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:29,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:29,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:29,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:29,007 INFO L87 Difference]: Start difference. First operand 38 states and 132 transitions. Second operand 8 states. [2019-01-20 10:05:29,569 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2019-01-20 10:05:30,497 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-01-20 10:05:31,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:31,271 INFO L93 Difference]: Finished difference Result 66 states and 183 transitions. [2019-01-20 10:05:31,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:31,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:05:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:31,273 INFO L225 Difference]: With dead ends: 66 [2019-01-20 10:05:31,273 INFO L226 Difference]: Without dead ends: 65 [2019-01-20 10:05:31,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:05:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-20 10:05:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 41. [2019-01-20 10:05:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:05:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-20 10:05:31,286 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 5 [2019-01-20 10:05:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:31,286 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-20 10:05:31,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:31,287 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-20 10:05:31,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:31,287 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:31,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:31,287 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:31,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:31,288 INFO L82 PathProgramCache]: Analyzing trace with hash 29231070, now seen corresponding path program 1 times [2019-01-20 10:05:31,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:31,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:31,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:31,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:31,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:31,501 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2019-01-20 10:05:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:31,558 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:31,558 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:31,558 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:31,558 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [23] [2019-01-20 10:05:31,559 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:31,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:31,562 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:31,562 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:05:31,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:31,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:31,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:31,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:31,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:31,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:31,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:31,580 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-01-20 10:05:31,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,584 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-01-20 10:05:31,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,589 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-01-20 10:05:31,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,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, 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-01-20 10:05:31,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,611 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-01-20 10:05:31,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:31,641 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:31,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:31,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:31,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:31,698 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-01-20 10:05:31,698 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:31,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,733 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-01-20 10:05:31,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:31,774 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-01-20 10:05:31,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:31,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,810 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:31,811 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-01-20 10:05:31,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:31,856 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-01-20 10:05:31,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:31,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:31,904 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-01-20 10:05:31,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:31,951 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-01-20 10:05:31,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:31,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:32,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:32,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:05:32,032 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:32,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:05:32,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:05:32,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:05:32,033 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 10 states. [2019-01-20 10:05:32,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:32,650 INFO L93 Difference]: Finished difference Result 93 states and 253 transitions. [2019-01-20 10:05:32,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:05:32,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:05:32,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:32,651 INFO L225 Difference]: With dead ends: 93 [2019-01-20 10:05:32,652 INFO L226 Difference]: Without dead ends: 92 [2019-01-20 10:05:32,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:05:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-20 10:05:32,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 48. [2019-01-20 10:05:32,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-20 10:05:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 192 transitions. [2019-01-20 10:05:32,667 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 192 transitions. Word has length 5 [2019-01-20 10:05:32,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:32,667 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 192 transitions. [2019-01-20 10:05:32,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:05:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 192 transitions. [2019-01-20 10:05:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:32,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:32,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:32,668 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:32,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:32,668 INFO L82 PathProgramCache]: Analyzing trace with hash 29248868, now seen corresponding path program 1 times [2019-01-20 10:05:32,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:32,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:32,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:32,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:32,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:32,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:32,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:32,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:32,745 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:32,745 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [27] [2019-01-20 10:05:32,746 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:32,746 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:32,748 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:32,748 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:05:32,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:32,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:32,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:32,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:32,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:32,757 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:32,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:32,798 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-01-20 10:05:32,840 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-01-20 10:05:32,928 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-01-20 10:05:32,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:32,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-20 10:05:33,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:33,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:33,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-20 10:05:33,014 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:33,029 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:33,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:33,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:33,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:33,074 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-01-20 10:05:33,074 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-20 10:05:33,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:33,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:33,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:33,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:33,099 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-01-20 10:05:33,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:33,116 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-01-20 10:05:33,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:05:33,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:33,128 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:33,157 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:05:33,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-20 10:05:33,157 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:05:33,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:05:33,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:05:33,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:33,158 INFO L87 Difference]: Start difference. First operand 48 states and 192 transitions. Second operand 4 states. [2019-01-20 10:05:33,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:33,201 INFO L93 Difference]: Finished difference Result 56 states and 215 transitions. [2019-01-20 10:05:33,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:05:33,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-20 10:05:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:33,203 INFO L225 Difference]: With dead ends: 56 [2019-01-20 10:05:33,204 INFO L226 Difference]: Without dead ends: 55 [2019-01-20 10:05:33,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:33,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-20 10:05:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-20 10:05:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-20 10:05:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 211 transitions. [2019-01-20 10:05:33,216 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 211 transitions. Word has length 5 [2019-01-20 10:05:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:33,217 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 211 transitions. [2019-01-20 10:05:33,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:05:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 211 transitions. [2019-01-20 10:05:33,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:33,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:33,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:33,217 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:33,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:33,218 INFO L82 PathProgramCache]: Analyzing trace with hash 29235350, now seen corresponding path program 1 times [2019-01-20 10:05:33,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:33,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:33,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:33,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:33,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:33,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:33,293 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [25] [2019-01-20 10:05:33,293 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:33,294 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:33,297 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:33,298 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:33,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:33,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:33,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:33,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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:33,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:33,307 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:33,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:33,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:33,317 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-01-20 10:05:33,322 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-01-20 10:05:33,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:33,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:33,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:33,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:33,342 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:33,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:33,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:33,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:33,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 27 treesize of output 50 [2019-01-20 10:05:33,355 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:33,374 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:33,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:33,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:33,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:33,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-01-20 10:05:33,423 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:34,298 WARN L181 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-20 10:05:34,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,312 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-01-20 10:05:34,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:34,366 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-01-20 10:05:34,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:34,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:34,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 31 treesize of output 65 [2019-01-20 10:05:34,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:34,434 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-01-20 10:05:34,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:34,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:34,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:34,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:34,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:34,492 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:34,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:34,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:34,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:34,493 INFO L87 Difference]: Start difference. First operand 52 states and 211 transitions. Second operand 8 states. [2019-01-20 10:05:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:34,860 INFO L93 Difference]: Finished difference Result 85 states and 266 transitions. [2019-01-20 10:05:34,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:05:34,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:05:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:34,861 INFO L225 Difference]: With dead ends: 85 [2019-01-20 10:05:34,862 INFO L226 Difference]: Without dead ends: 84 [2019-01-20 10:05:34,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:05:34,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-20 10:05:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 54. [2019-01-20 10:05:34,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-20 10:05:34,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 223 transitions. [2019-01-20 10:05:34,880 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 223 transitions. Word has length 5 [2019-01-20 10:05:34,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:34,880 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 223 transitions. [2019-01-20 10:05:34,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 223 transitions. [2019-01-20 10:05:34,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:34,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:34,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:34,881 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:34,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:34,881 INFO L82 PathProgramCache]: Analyzing trace with hash 29235038, now seen corresponding path program 1 times [2019-01-20 10:05:34,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:34,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:34,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:34,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:34,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:35,042 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:35,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:35,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:35,042 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:35,043 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [23] [2019-01-20 10:05:35,044 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:35,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:35,046 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:35,047 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:05:35,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:35,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:35,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:35,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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:35,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:35,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:35,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:35,078 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-01-20 10:05:35,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,082 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-01-20 10:05:35,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,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 23 treesize of output 37 [2019-01-20 10:05:35,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,098 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-01-20 10:05:35,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,108 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-01-20 10:05:35,108 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:35,145 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:35,166 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:35,186 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:35,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:35,218 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-01-20 10:05:35,218 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:35,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,268 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-01-20 10:05:35,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:35,319 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-01-20 10:05:35,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:35,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,374 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-01-20 10:05:35,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:35,431 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-01-20 10:05:35,432 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:35,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:35,470 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:35,471 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-01-20 10:05:35,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:35,568 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-01-20 10:05:35,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:35,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:35,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:35,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:05:35,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:35,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:05:35,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:05:35,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:05:35,669 INFO L87 Difference]: Start difference. First operand 54 states and 223 transitions. Second operand 10 states. [2019-01-20 10:05:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:36,472 INFO L93 Difference]: Finished difference Result 96 states and 303 transitions. [2019-01-20 10:05:36,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:05:36,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:05:36,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:36,474 INFO L225 Difference]: With dead ends: 96 [2019-01-20 10:05:36,474 INFO L226 Difference]: Without dead ends: 94 [2019-01-20 10:05:36,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:05:36,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-20 10:05:36,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2019-01-20 10:05:36,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 10:05:36,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-20 10:05:36,490 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-20 10:05:36,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:36,490 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-20 10:05:36,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:05:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-20 10:05:36,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:36,491 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:36,491 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:36,491 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:36,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash 29239194, now seen corresponding path program 1 times [2019-01-20 10:05:36,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:36,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:36,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:36,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:36,492 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:36,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:36,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:36,606 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:36,606 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [25] [2019-01-20 10:05:36,607 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:36,607 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:36,610 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:36,610 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:36,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:36,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:36,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:36,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:36,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:36,620 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:36,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:36,629 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-01-20 10:05:36,636 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-01-20 10:05:36,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:36,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,667 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:36,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,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, 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-01-20 10:05:36,684 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:36,703 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:36,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:36,724 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:36,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:36,750 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-01-20 10:05:36,751 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:36,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:36,798 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-01-20 10:05:36,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:36,983 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-01-20 10:05:36,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:37,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,009 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:37,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, 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-01-20 10:05:37,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:37,038 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-01-20 10:05:37,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:37,054 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:37,075 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:37,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:37,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:37,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:37,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:37,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:37,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:37,095 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-20 10:05:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:37,357 INFO L93 Difference]: Finished difference Result 82 states and 289 transitions. [2019-01-20 10:05:37,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:37,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:05:37,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:37,358 INFO L225 Difference]: With dead ends: 82 [2019-01-20 10:05:37,359 INFO L226 Difference]: Without dead ends: 81 [2019-01-20 10:05:37,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-01-20 10:05:37,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-20 10:05:37,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 61. [2019-01-20 10:05:37,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-20 10:05:37,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 265 transitions. [2019-01-20 10:05:37,380 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 265 transitions. Word has length 5 [2019-01-20 10:05:37,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:37,380 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 265 transitions. [2019-01-20 10:05:37,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:37,380 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 265 transitions. [2019-01-20 10:05:37,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:37,381 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:37,381 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:37,381 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:37,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:37,382 INFO L82 PathProgramCache]: Analyzing trace with hash 28818276, now seen corresponding path program 1 times [2019-01-20 10:05:37,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:37,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:37,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:37,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:37,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:37,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:37,474 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:37,474 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:37,474 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [25] [2019-01-20 10:05:37,475 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:37,475 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:37,478 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:37,478 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:37,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:37,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:37,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:37,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:37,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:37,488 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:37,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:37,498 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-01-20 10:05:37,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,500 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-01-20 10:05:37,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,510 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-01-20 10:05:37,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,518 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-01-20 10:05:37,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,525 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-01-20 10:05:37,525 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:37,552 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:37,566 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:37,578 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:37,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:37,605 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-01-20 10:05:37,606 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:37,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,645 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-01-20 10:05:37,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:37,687 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-01-20 10:05:37,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:37,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:37,850 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-01-20 10:05:37,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:37,896 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-01-20 10:05:37,896 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:37,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:37,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:37,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:37,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:05:37,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:37,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:37,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:37,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:05:37,943 INFO L87 Difference]: Start difference. First operand 61 states and 265 transitions. Second operand 8 states. [2019-01-20 10:05:38,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:38,281 INFO L93 Difference]: Finished difference Result 87 states and 319 transitions. [2019-01-20 10:05:38,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:05:38,282 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:05:38,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:38,283 INFO L225 Difference]: With dead ends: 87 [2019-01-20 10:05:38,283 INFO L226 Difference]: Without dead ends: 86 [2019-01-20 10:05:38,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-20 10:05:38,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 67. [2019-01-20 10:05:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-20 10:05:38,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 302 transitions. [2019-01-20 10:05:38,304 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 302 transitions. Word has length 5 [2019-01-20 10:05:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:38,305 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 302 transitions. [2019-01-20 10:05:38,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 302 transitions. [2019-01-20 10:05:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:38,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:38,305 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:38,306 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:38,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash 28822120, now seen corresponding path program 1 times [2019-01-20 10:05:38,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:38,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:38,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:05:38,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:38,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:38,395 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:38,396 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [25] [2019-01-20 10:05:38,398 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:38,398 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:38,400 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:38,401 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:38,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:38,401 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:38,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:38,401 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:38,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:38,415 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:38,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:38,423 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-01-20 10:05:38,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,431 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-01-20 10:05:38,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,440 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-01-20 10:05:38,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,450 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-01-20 10:05:38,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,471 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-01-20 10:05:38,471 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:38,497 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:38,540 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:38,552 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:38,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:38,579 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-01-20 10:05:38,580 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:38,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,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, 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-01-20 10:05:38,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:38,654 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-01-20 10:05:38,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:38,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:38,689 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:38,690 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-01-20 10:05:38,690 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:38,735 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-01-20 10:05:38,736 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:38,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-01-20 10:05:38,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:38,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-01-20 10:05:38,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:38,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:38,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:38,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:38,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:38,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:38,797 INFO L87 Difference]: Start difference. First operand 67 states and 302 transitions. Second operand 8 states. [2019-01-20 10:05:39,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:39,128 INFO L93 Difference]: Finished difference Result 86 states and 334 transitions. [2019-01-20 10:05:39,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:39,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:05:39,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:39,130 INFO L225 Difference]: With dead ends: 86 [2019-01-20 10:05:39,130 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:05:39,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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-01-20 10:05:39,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:05:39,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 69. [2019-01-20 10:05:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-20 10:05:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 314 transitions. [2019-01-20 10:05:39,151 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 314 transitions. Word has length 5 [2019-01-20 10:05:39,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:39,151 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 314 transitions. [2019-01-20 10:05:39,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:39,151 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 314 transitions. [2019-01-20 10:05:39,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:39,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:39,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:39,152 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:39,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:39,152 INFO L82 PathProgramCache]: Analyzing trace with hash 28947050, now seen corresponding path program 2 times [2019-01-20 10:05:39,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:39,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:39,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:39,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:39,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:39,428 WARN L181 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-20 10:05:39,748 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-20 10:05:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:39,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:39,837 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:39,838 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:39,838 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:39,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:39,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:39,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:05:39,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:05:39,877 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:05:39,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:39,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:39,882 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-01-20 10:05:39,884 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-01-20 10:05:39,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:39,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:39,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:39,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:39,920 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:39,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:39,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:39,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:39,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-01-20 10:05:39,932 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:39,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:39,962 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:39,972 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:39,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:39,997 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-01-20 10:05:39,998 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:40,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,029 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-01-20 10:05:40,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:40,058 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-01-20 10:05:40,059 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:40,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:40,087 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-01-20 10:05:40,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:40,114 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-01-20 10:05:40,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:05:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:40,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:40,180 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:40,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:40,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:05:40,198 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:40,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:40,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:40,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:05:40,199 INFO L87 Difference]: Start difference. First operand 69 states and 314 transitions. Second operand 8 states. [2019-01-20 10:05:41,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:41,194 INFO L93 Difference]: Finished difference Result 110 states and 397 transitions. [2019-01-20 10:05:41,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:05:41,195 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:05:41,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:41,196 INFO L225 Difference]: With dead ends: 110 [2019-01-20 10:05:41,196 INFO L226 Difference]: Without dead ends: 107 [2019-01-20 10:05:41,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:41,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-20 10:05:41,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 78. [2019-01-20 10:05:41,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-20 10:05:41,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 360 transitions. [2019-01-20 10:05:41,227 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 360 transitions. Word has length 5 [2019-01-20 10:05:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:41,228 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 360 transitions. [2019-01-20 10:05:41,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 360 transitions. [2019-01-20 10:05:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:41,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:41,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:41,229 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:41,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:41,229 INFO L82 PathProgramCache]: Analyzing trace with hash 28950958, now seen corresponding path program 1 times [2019-01-20 10:05:41,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:41,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:41,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:41,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:41,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:41,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:41,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:41,371 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:41,371 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [27] [2019-01-20 10:05:41,372 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:41,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:41,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:41,375 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:05:41,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:41,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:41,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:41,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:41,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:41,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:41,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:41,392 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-01-20 10:05:41,397 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-01-20 10:05:41,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,408 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:41,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,424 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:41,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,435 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-01-20 10:05:41,435 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:41,456 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:41,467 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:41,476 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:41,486 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:41,503 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-01-20 10:05:41,503 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:41,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:41,540 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-01-20 10:05:41,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:41,571 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-01-20 10:05:41,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:41,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:41,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:41,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:41,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:05:41,620 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:41,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:05:41,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:05:41,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:05:41,621 INFO L87 Difference]: Start difference. First operand 78 states and 360 transitions. Second operand 6 states. [2019-01-20 10:05:41,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:41,907 INFO L93 Difference]: Finished difference Result 87 states and 367 transitions. [2019-01-20 10:05:41,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:05:41,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-20 10:05:41,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:41,909 INFO L225 Difference]: With dead ends: 87 [2019-01-20 10:05:41,909 INFO L226 Difference]: Without dead ends: 86 [2019-01-20 10:05:41,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-01-20 10:05:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-20 10:05:41,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 76. [2019-01-20 10:05:41,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-20 10:05:41,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 357 transitions. [2019-01-20 10:05:41,928 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 357 transitions. Word has length 5 [2019-01-20 10:05:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:41,929 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 357 transitions. [2019-01-20 10:05:41,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:05:41,929 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 357 transitions. [2019-01-20 10:05:41,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:41,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:41,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:41,930 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:41,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:41,930 INFO L82 PathProgramCache]: Analyzing trace with hash 29052324, now seen corresponding path program 1 times [2019-01-20 10:05:41,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:41,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:41,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:41,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:41,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:42,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:42,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:42,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:42,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:42,063 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [23] [2019-01-20 10:05:42,064 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:42,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:42,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:42,066 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:05:42,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:42,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:42,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:42,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:42,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:42,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:42,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:42,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:42,087 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-01-20 10:05:42,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,091 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-01-20 10:05:42,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,106 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-01-20 10:05:42,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,118 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-01-20 10:05:42,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,129 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-01-20 10:05:42,129 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:42,156 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:42,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:42,182 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:42,192 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:42,210 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-01-20 10:05:42,210 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:42,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,243 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-01-20 10:05:42,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:42,283 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-01-20 10:05:42,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:42,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,320 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:42,321 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-01-20 10:05:42,322 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:42,365 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-01-20 10:05:42,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:42,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:42,402 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-01-20 10:05:42,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:42,458 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-01-20 10:05:42,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:42,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:42,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:42,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:05:42,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:42,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:05:42,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:05:42,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:05:42,537 INFO L87 Difference]: Start difference. First operand 76 states and 357 transitions. Second operand 10 states. [2019-01-20 10:05:43,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:43,099 INFO L93 Difference]: Finished difference Result 133 states and 461 transitions. [2019-01-20 10:05:43,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:05:43,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:05:43,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:43,101 INFO L225 Difference]: With dead ends: 133 [2019-01-20 10:05:43,101 INFO L226 Difference]: Without dead ends: 132 [2019-01-20 10:05:43,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:05:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-20 10:05:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 75. [2019-01-20 10:05:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-20 10:05:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 351 transitions. [2019-01-20 10:05:43,122 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 351 transitions. Word has length 5 [2019-01-20 10:05:43,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:43,122 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 351 transitions. [2019-01-20 10:05:43,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:05:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 351 transitions. [2019-01-20 10:05:43,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:05:43,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:43,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:05:43,123 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:43,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:43,124 INFO L82 PathProgramCache]: Analyzing trace with hash 29056604, now seen corresponding path program 1 times [2019-01-20 10:05:43,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:43,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:43,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:43,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:43,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:43,282 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-20 10:05:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:43,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:43,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:43,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:05:43,292 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [25] [2019-01-20 10:05:43,293 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:43,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:43,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:43,296 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 3. Performed 66 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:43,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:43,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:43,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:43,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:43,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:43,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:43,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:43,316 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-01-20 10:05:43,318 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-01-20 10:05:43,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:43,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,334 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:43,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:05:43,346 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:43,365 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:43,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:43,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:43,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:43,414 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-01-20 10:05:43,415 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:43,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,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 51 [2019-01-20 10:05:43,450 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:43,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-01-20 10:05:43,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:43,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:43,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 31 treesize of output 65 [2019-01-20 10:05:43,506 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:43,537 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-01-20 10:05:43,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:43,551 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:43,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:43,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:43,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:43,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:43,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:43,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:43,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:43,588 INFO L87 Difference]: Start difference. First operand 75 states and 351 transitions. Second operand 8 states. [2019-01-20 10:05:43,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:43,927 INFO L93 Difference]: Finished difference Result 113 states and 411 transitions. [2019-01-20 10:05:43,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:05:43,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:05:43,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:43,929 INFO L225 Difference]: With dead ends: 113 [2019-01-20 10:05:43,929 INFO L226 Difference]: Without dead ends: 112 [2019-01-20 10:05:43,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:05:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-20 10:05:43,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 77. [2019-01-20 10:05:43,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:05:43,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 363 transitions. [2019-01-20 10:05:43,956 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 363 transitions. Word has length 5 [2019-01-20 10:05:43,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:43,956 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 363 transitions. [2019-01-20 10:05:43,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:43,957 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 363 transitions. [2019-01-20 10:05:43,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:43,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:43,957 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:05:43,958 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:43,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:43,958 INFO L82 PathProgramCache]: Analyzing trace with hash 904669396, now seen corresponding path program 2 times [2019-01-20 10:05:43,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:43,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:43,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:43,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:43,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:05:44,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:44,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:44,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:44,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:44,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:44,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:44,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:05:44,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:05:44,094 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:05:44,095 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:44,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:44,101 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-01-20 10:05:44,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,104 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-01-20 10:05:44,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,116 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-01-20 10:05:44,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,125 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-01-20 10:05:44,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,134 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-01-20 10:05:44,134 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:44,174 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:44,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:44,236 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:44,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:44,264 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-01-20 10:05:44,264 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:44,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,300 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-01-20 10:05:44,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:44,339 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-01-20 10:05:44,340 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:44,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,379 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-01-20 10:05:44,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:44,433 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-01-20 10:05:44,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-20 10:05:44,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,471 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-01-20 10:05:44,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:44,521 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-01-20 10:05:44,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:44,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:44,568 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 38 treesize of output 110 [2019-01-20 10:05:44,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:44,620 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-01-20 10:05:44,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:44,643 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:44,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:44,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:44,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:05:44,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:44,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:05:44,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:05:44,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:05:44,708 INFO L87 Difference]: Start difference. First operand 77 states and 363 transitions. Second operand 11 states. [2019-01-20 10:05:45,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:45,512 INFO L93 Difference]: Finished difference Result 136 states and 478 transitions. [2019-01-20 10:05:45,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:05:45,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:05:45,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:45,514 INFO L225 Difference]: With dead ends: 136 [2019-01-20 10:05:45,514 INFO L226 Difference]: Without dead ends: 131 [2019-01-20 10:05:45,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:05:45,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-20 10:05:45,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2019-01-20 10:05:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:05:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-20 10:05:45,543 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-20 10:05:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:45,543 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-20 10:05:45,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:05:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-20 10:05:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:45,544 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:45,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:05:45,544 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:45,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:45,544 INFO L82 PathProgramCache]: Analyzing trace with hash 904729414, now seen corresponding path program 1 times [2019-01-20 10:05:45,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:45,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:45,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:45,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:45,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:45,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:45,746 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-20 10:05:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:45,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:45,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:45,807 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:05:45,807 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [25] [2019-01-20 10:05:45,809 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:45,809 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:45,812 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:45,812 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:05:45,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:45,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:45,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:45,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:45,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:45,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:45,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:45,830 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-01-20 10:05:45,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:45,838 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-01-20 10:05:45,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:45,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:45,843 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-01-20 10:05:45,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:45,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:45,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:45,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-01-20 10:05:45,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:45,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:45,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:45,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:45,897 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-01-20 10:05:45,898 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:45,925 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:45,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:45,951 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:45,961 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:45,980 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-01-20 10:05:45,980 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:46,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,016 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-01-20 10:05:46,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:46,057 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-01-20 10:05:46,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:46,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,093 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-01-20 10:05:46,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:46,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-01-20 10:05:46,139 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:46,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:46,182 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:46,182 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-01-20 10:05:46,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:46,230 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-01-20 10:05:46,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:46,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:46,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:46,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:46,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:05:46,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:46,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:05:46,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:05:46,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:05:46,310 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 10 states. [2019-01-20 10:05:46,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:46,792 INFO L93 Difference]: Finished difference Result 106 states and 409 transitions. [2019-01-20 10:05:46,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:05:46,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:05:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:46,794 INFO L225 Difference]: With dead ends: 106 [2019-01-20 10:05:46,794 INFO L226 Difference]: Without dead ends: 105 [2019-01-20 10:05:46,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:05:46,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-20 10:05:46,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2019-01-20 10:05:46,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:05:46,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-20 10:05:46,814 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-20 10:05:46,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:46,814 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-20 10:05:46,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:05:46,815 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-20 10:05:46,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:46,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:46,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:05:46,815 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:46,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:46,816 INFO L82 PathProgramCache]: Analyzing trace with hash 904728978, now seen corresponding path program 1 times [2019-01-20 10:05:46,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:46,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:46,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:46,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:46,817 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:47,309 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-20 10:05:47,386 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:47,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:47,386 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:47,386 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:05:47,386 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [23] [2019-01-20 10:05:47,387 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:47,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:47,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:47,389 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:05:47,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:47,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:47,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:47,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:47,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:47,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:47,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:47,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:47,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 18 treesize of output 21 [2019-01-20 10:05:47,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,410 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-01-20 10:05:47,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,415 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-01-20 10:05:47,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,420 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-01-20 10:05:47,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,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, 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-01-20 10:05:47,428 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:47,454 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:47,469 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:47,481 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:47,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:47,510 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-01-20 10:05:47,510 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:47,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,549 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-01-20 10:05:47,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:47,590 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-01-20 10:05:47,590 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:47,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,636 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-01-20 10:05:47,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:47,710 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-01-20 10:05:47,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:47,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,752 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:47,753 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-01-20 10:05:47,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:47,816 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-01-20 10:05:47,816 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:47,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,853 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:47,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:47,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 93 [2019-01-20 10:05:47,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:47,901 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-01-20 10:05:47,901 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:05:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:47,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:47,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:47,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:47,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:05:47,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:47,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:05:47,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:05:47,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:05:47,999 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-20 10:05:48,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:48,732 INFO L93 Difference]: Finished difference Result 131 states and 463 transitions. [2019-01-20 10:05:48,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:05:48,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:05:48,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:48,734 INFO L225 Difference]: With dead ends: 131 [2019-01-20 10:05:48,734 INFO L226 Difference]: Without dead ends: 130 [2019-01-20 10:05:48,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:05:48,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-20 10:05:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 77. [2019-01-20 10:05:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:05:48,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-20 10:05:48,754 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-20 10:05:48,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:48,755 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-20 10:05:48,755 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:05:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-20 10:05:48,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:48,755 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:48,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:05:48,756 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:48,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:48,756 INFO L82 PathProgramCache]: Analyzing trace with hash 904746776, now seen corresponding path program 1 times [2019-01-20 10:05:48,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:48,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:48,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:48,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:48,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:48,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:48,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:48,857 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:05:48,858 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [27] [2019-01-20 10:05:48,859 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:48,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:48,861 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:48,862 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:48,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:48,862 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:48,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:48,862 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:48,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:48,871 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:48,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:48,881 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-01-20 10:05:48,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-01-20 10:05:48,892 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-01-20 10:05:48,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:48,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, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-20 10:05:48,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:48,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:48,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-20 10:05:48,912 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:48,926 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:48,936 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:48,946 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:48,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:48,970 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-01-20 10:05:48,970 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-20 10:05:48,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:48,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:48,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:48,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,000 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-01-20 10:05:49,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:49,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-01-20 10:05:49,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:05:49,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,035 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 42 [2019-01-20 10:05:49,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:49,052 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-01-20 10:05:49,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-20 10:05:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:49,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:49,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:49,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:49,106 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:49,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:49,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:49,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:49,107 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 8 states. [2019-01-20 10:05:49,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:49,331 INFO L93 Difference]: Finished difference Result 93 states and 382 transitions. [2019-01-20 10:05:49,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:49,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:05:49,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:49,333 INFO L225 Difference]: With dead ends: 93 [2019-01-20 10:05:49,334 INFO L226 Difference]: Without dead ends: 92 [2019-01-20 10:05:49,334 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-01-20 10:05:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-20 10:05:49,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 77. [2019-01-20 10:05:49,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:05:49,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 362 transitions. [2019-01-20 10:05:49,356 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 362 transitions. Word has length 6 [2019-01-20 10:05:49,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:49,356 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 362 transitions. [2019-01-20 10:05:49,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:49,356 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 362 transitions. [2019-01-20 10:05:49,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:49,357 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:49,357 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:05:49,357 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:49,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:49,357 INFO L82 PathProgramCache]: Analyzing trace with hash 904732946, now seen corresponding path program 1 times [2019-01-20 10:05:49,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:49,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:49,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:49,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:49,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:49,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:49,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:49,552 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:05:49,553 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [23] [2019-01-20 10:05:49,553 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:49,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:49,556 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:49,556 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:05:49,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:49,557 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:49,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:49,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:49,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:49,566 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:49,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:49,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:05:49,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,616 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-01-20 10:05:49,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,625 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-01-20 10:05:49,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,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, 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-01-20 10:05:49,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,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, 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-01-20 10:05:49,638 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:49,666 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:49,679 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:49,690 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:49,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:49,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:49,718 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:49,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,753 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-01-20 10:05:49,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:49,795 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-01-20 10:05:49,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:49,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:49,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,070 INFO L303 Elim1Store]: Index analysis took 252 ms [2019-01-20 10:05:50,071 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-01-20 10:05:50,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:50,113 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-01-20 10:05:50,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:50,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,151 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:50,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,153 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-01-20 10:05:50,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:50,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-01-20 10:05:50,202 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-20 10:05:50,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:50,242 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:50,243 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 100 [2019-01-20 10:05:50,244 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:50,290 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-01-20 10:05:50,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:05:50,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:50,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:50,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:50,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:50,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:05:50,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:50,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:05:50,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:05:50,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:05:50,436 INFO L87 Difference]: Start difference. First operand 77 states and 362 transitions. Second operand 12 states. [2019-01-20 10:05:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:51,451 INFO L93 Difference]: Finished difference Result 117 states and 435 transitions. [2019-01-20 10:05:51,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:05:51,452 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:05:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:51,453 INFO L225 Difference]: With dead ends: 117 [2019-01-20 10:05:51,453 INFO L226 Difference]: Without dead ends: 115 [2019-01-20 10:05:51,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:05:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-20 10:05:51,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 74. [2019-01-20 10:05:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-20 10:05:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 344 transitions. [2019-01-20 10:05:51,480 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 344 transitions. Word has length 6 [2019-01-20 10:05:51,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:51,480 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 344 transitions. [2019-01-20 10:05:51,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:05:51,480 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 344 transitions. [2019-01-20 10:05:51,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:51,481 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:51,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:05:51,481 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:51,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:51,481 INFO L82 PathProgramCache]: Analyzing trace with hash 904737102, now seen corresponding path program 1 times [2019-01-20 10:05:51,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:51,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:51,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:51,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:51,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:51,664 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-20 10:05:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:51,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:51,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:51,728 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:05:51,728 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [25] [2019-01-20 10:05:51,729 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:51,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:51,731 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:51,731 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:05:51,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:51,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:51,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:51,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:51,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:51,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:51,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:51,749 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-01-20 10:05:51,754 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-01-20 10:05:51,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:51,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,771 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:51,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,781 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-01-20 10:05:51,782 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:51,801 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:51,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:51,822 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:51,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:51,849 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-01-20 10:05:51,849 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:51,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,891 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-01-20 10:05:51,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:51,917 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-01-20 10:05:51,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:51,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,948 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-01-20 10:05:51,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:51,975 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-01-20 10:05:51,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:05:51,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:51,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,008 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:52,009 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-01-20 10:05:52,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:52,041 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-01-20 10:05:52,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:05:52,059 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:52,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:52,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:52,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:05:52,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:52,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:05:52,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:05:52,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:05:52,116 INFO L87 Difference]: Start difference. First operand 74 states and 344 transitions. Second operand 10 states. [2019-01-20 10:05:52,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:52,565 INFO L93 Difference]: Finished difference Result 99 states and 372 transitions. [2019-01-20 10:05:52,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:05:52,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:05:52,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:52,567 INFO L225 Difference]: With dead ends: 99 [2019-01-20 10:05:52,567 INFO L226 Difference]: Without dead ends: 98 [2019-01-20 10:05:52,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:05:52,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-20 10:05:52,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 73. [2019-01-20 10:05:52,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 10:05:52,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 338 transitions. [2019-01-20 10:05:52,589 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 338 transitions. Word has length 6 [2019-01-20 10:05:52,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:52,589 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 338 transitions. [2019-01-20 10:05:52,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:05:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 338 transitions. [2019-01-20 10:05:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:52,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:52,589 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-20 10:05:52,589 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:52,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:52,590 INFO L82 PathProgramCache]: Analyzing trace with hash 904323436, now seen corresponding path program 3 times [2019-01-20 10:05:52,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:52,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:52,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:52,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:52,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:05:52,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:52,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:52,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:05:52,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:05:52,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:52,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:52,738 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:05:52,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:05:52,746 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:05:52,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:05:52,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:52,749 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-01-20 10:05:52,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,755 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-01-20 10:05:52,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,761 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-01-20 10:05:52,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,768 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-01-20 10:05:52,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,779 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-01-20 10:05:52,779 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:52,805 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:52,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:52,831 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:52,841 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:52,860 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-01-20 10:05:52,860 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:52,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,901 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-01-20 10:05:52,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:52,941 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-01-20 10:05:52,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:52,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:52,982 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-01-20 10:05:52,983 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:53,028 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-01-20 10:05:53,028 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:53,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,070 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 38 treesize of output 98 [2019-01-20 10:05:53,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:53,122 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-01-20 10:05:53,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-20 10:05:53,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:53,170 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 38 treesize of output 110 [2019-01-20 10:05:53,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:53,223 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-01-20 10:05:53,224 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:53,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:53,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:53,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:53,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:05:53,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:53,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:05:53,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:05:53,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:05:53,322 INFO L87 Difference]: Start difference. First operand 73 states and 338 transitions. Second operand 11 states. [2019-01-20 10:05:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:54,046 INFO L93 Difference]: Finished difference Result 132 states and 470 transitions. [2019-01-20 10:05:54,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:05:54,046 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-20 10:05:54,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:54,047 INFO L225 Difference]: With dead ends: 132 [2019-01-20 10:05:54,047 INFO L226 Difference]: Without dead ends: 130 [2019-01-20 10:05:54,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:05:54,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-20 10:05:54,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 74. [2019-01-20 10:05:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-20 10:05:54,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 334 transitions. [2019-01-20 10:05:54,080 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 334 transitions. Word has length 6 [2019-01-20 10:05:54,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:54,080 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 334 transitions. [2019-01-20 10:05:54,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:05:54,080 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 334 transitions. [2019-01-20 10:05:54,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:54,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:54,081 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:05:54,081 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:54,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:54,081 INFO L82 PathProgramCache]: Analyzing trace with hash 904329702, now seen corresponding path program 1 times [2019-01-20 10:05:54,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:54,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:54,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:05:54,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:54,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:54,314 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-20 10:05:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:54,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:54,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:54,339 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:05:54,339 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [27] [2019-01-20 10:05:54,341 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:54,341 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:54,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:54,343 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:54,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:54,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:54,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:54,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:54,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:54,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:54,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:54,361 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-01-20 10:05:54,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,365 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-01-20 10:05:54,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,369 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-01-20 10:05:54,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,374 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-01-20 10:05:54,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,388 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-01-20 10:05:54,388 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:54,415 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:54,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:54,442 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:54,452 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:54,471 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-01-20 10:05:54,471 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:54,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,505 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-01-20 10:05:54,505 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:54,545 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-01-20 10:05:54,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:54,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:54,581 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-01-20 10:05:54,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:54,628 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-01-20 10:05:54,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:54,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:54,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:54,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:54,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:54,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:54,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:54,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:54,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:54,691 INFO L87 Difference]: Start difference. First operand 74 states and 334 transitions. Second operand 8 states. [2019-01-20 10:05:55,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:55,034 INFO L93 Difference]: Finished difference Result 87 states and 350 transitions. [2019-01-20 10:05:55,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:55,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:05:55,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:55,036 INFO L225 Difference]: With dead ends: 87 [2019-01-20 10:05:55,036 INFO L226 Difference]: Without dead ends: 86 [2019-01-20 10:05:55,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:05:55,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-20 10:05:55,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 73. [2019-01-20 10:05:55,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-20 10:05:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 337 transitions. [2019-01-20 10:05:55,067 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 337 transitions. Word has length 6 [2019-01-20 10:05:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:55,068 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 337 transitions. [2019-01-20 10:05:55,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 337 transitions. [2019-01-20 10:05:55,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:55,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:55,069 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:05:55,069 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:55,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:55,069 INFO L82 PathProgramCache]: Analyzing trace with hash 904316184, now seen corresponding path program 1 times [2019-01-20 10:05:55,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:55,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:55,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:55,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:55,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:55,200 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:05:55,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:55,201 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:55,201 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:05:55,201 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [25] [2019-01-20 10:05:55,202 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:55,202 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:55,205 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:55,205 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:05:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:55,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:55,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:55,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:55,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:55,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:55,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:55,256 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-01-20 10:05:55,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,282 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-01-20 10:05:55,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,286 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-01-20 10:05:55,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,293 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-01-20 10:05:55,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,307 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-01-20 10:05:55,307 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:55,334 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:55,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:55,361 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:55,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:55,390 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-01-20 10:05:55,390 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:55,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,423 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-01-20 10:05:55,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:55,463 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-01-20 10:05:55,463 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:55,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,514 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-01-20 10:05:55,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:55,568 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-01-20 10:05:55,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:55,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,630 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:55,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:55,632 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-01-20 10:05:55,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:55,701 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-01-20 10:05:55,702 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:05:55,727 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:55,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:55,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:55,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:05:55,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:55,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:05:55,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:05:55,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:05:55,814 INFO L87 Difference]: Start difference. First operand 73 states and 337 transitions. Second operand 10 states. [2019-01-20 10:05:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:56,276 INFO L93 Difference]: Finished difference Result 106 states and 387 transitions. [2019-01-20 10:05:56,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:05:56,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:05:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:56,278 INFO L225 Difference]: With dead ends: 106 [2019-01-20 10:05:56,278 INFO L226 Difference]: Without dead ends: 105 [2019-01-20 10:05:56,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:05:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-20 10:05:56,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 75. [2019-01-20 10:05:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-20 10:05:56,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 349 transitions. [2019-01-20 10:05:56,312 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 349 transitions. Word has length 6 [2019-01-20 10:05:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:56,313 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 349 transitions. [2019-01-20 10:05:56,313 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:05:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 349 transitions. [2019-01-20 10:05:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:56,314 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:56,314 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:05:56,314 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash 904320028, now seen corresponding path program 1 times [2019-01-20 10:05:56,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:56,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:56,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:56,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:56,315 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:56,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:05:56,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:56,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:56,449 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:05:56,449 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [25] [2019-01-20 10:05:56,450 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:56,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:56,452 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:56,452 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:05:56,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:56,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:56,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:56,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:56,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:56,472 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:56,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:56,511 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-01-20 10:05:56,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,517 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-01-20 10:05:56,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,522 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-01-20 10:05:56,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,559 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-01-20 10:05:56,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,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, 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-01-20 10:05:56,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:56,607 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:56,622 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:56,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:56,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:56,661 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-01-20 10:05:56,662 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:56,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,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, 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-01-20 10:05:56,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:56,743 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-01-20 10:05:56,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:05:56,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,780 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-01-20 10:05:56,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:56,827 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-01-20 10:05:56,828 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:56,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:56,868 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:56,869 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 104 [2019-01-20 10:05:56,870 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:56,919 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-01-20 10:05:56,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:05:56,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:56,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:56,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:56,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:56,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:05:56,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:56,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:05:56,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:05:56,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:05:56,998 INFO L87 Difference]: Start difference. First operand 75 states and 349 transitions. Second operand 10 states. [2019-01-20 10:05:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:57,516 INFO L93 Difference]: Finished difference Result 102 states and 394 transitions. [2019-01-20 10:05:57,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:05:57,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:05:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:57,518 INFO L225 Difference]: With dead ends: 102 [2019-01-20 10:05:57,518 INFO L226 Difference]: Without dead ends: 101 [2019-01-20 10:05:57,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:05:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-20 10:05:57,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 78. [2019-01-20 10:05:57,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-20 10:05:57,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-20 10:05:57,548 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-20 10:05:57,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:57,548 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-20 10:05:57,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:05:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-20 10:05:57,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:57,548 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:57,549 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:05:57,549 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:57,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:57,549 INFO L82 PathProgramCache]: Analyzing trace with hash 904448866, now seen corresponding path program 1 times [2019-01-20 10:05:57,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:57,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:57,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:57,550 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:57,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:57,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:57,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:57,631 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:05:57,632 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [27] [2019-01-20 10:05:57,634 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:57,634 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:57,637 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:57,637 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:05:57,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:57,638 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:57,638 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:57,638 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:57,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:57,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:57,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:57,667 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-01-20 10:05:57,674 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-01-20 10:05:57,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:57,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,699 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:57,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,714 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-01-20 10:05:57,714 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:57,734 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:57,744 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:57,754 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:57,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:57,780 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-01-20 10:05:57,780 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:57,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,819 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-01-20 10:05:57,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:57,965 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-01-20 10:05:57,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:57,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:57,988 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:57,988 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-01-20 10:05:57,989 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:58,019 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-01-20 10:05:58,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:05:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:58,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:58,056 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:58,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:58,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:05:58,075 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:58,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:05:58,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:05:58,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:05:58,076 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 8 states. [2019-01-20 10:05:58,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:58,347 INFO L93 Difference]: Finished difference Result 94 states and 387 transitions. [2019-01-20 10:05:58,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:05:58,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:05:58,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:58,349 INFO L225 Difference]: With dead ends: 94 [2019-01-20 10:05:58,349 INFO L226 Difference]: Without dead ends: 93 [2019-01-20 10:05:58,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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-01-20 10:05:58,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-20 10:05:58,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 78. [2019-01-20 10:05:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-20 10:05:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 367 transitions. [2019-01-20 10:05:58,395 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 367 transitions. Word has length 6 [2019-01-20 10:05:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:58,395 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 367 transitions. [2019-01-20 10:05:58,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:05:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 367 transitions. [2019-01-20 10:05:58,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:58,396 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:58,396 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:05:58,396 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:58,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:58,397 INFO L82 PathProgramCache]: Analyzing trace with hash 904439192, now seen corresponding path program 1 times [2019-01-20 10:05:58,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:58,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:58,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:58,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:58,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:58,628 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-20 10:05:58,673 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:58,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:58,674 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:58,674 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:05:58,674 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [25] [2019-01-20 10:05:58,675 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:58,676 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:58,678 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:58,678 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:05:58,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:58,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:58,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:58,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:58,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:58,690 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:58,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:58,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-01-20 10:05:58,704 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-01-20 10:05:58,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:05:58,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,724 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:05:58,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,732 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,734 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-01-20 10:05:58,735 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:58,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:58,781 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:58,790 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:58,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:58,815 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-01-20 10:05:58,816 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:05:58,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,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, 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-01-20 10:05:58,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:58,885 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-01-20 10:05:58,885 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:05:58,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,914 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:05:58,914 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-01-20 10:05:58,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:58,944 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-01-20 10:05:58,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-20 10:05:58,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:58,973 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 69 [2019-01-20 10:05:58,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:59,004 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-01-20 10:05:59,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:05:59,021 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:59,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:05:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:59,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:05:59,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:05:59,089 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:05:59,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:05:59,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:05:59,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:05:59,090 INFO L87 Difference]: Start difference. First operand 78 states and 367 transitions. Second operand 10 states. [2019-01-20 10:05:59,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:05:59,481 INFO L93 Difference]: Finished difference Result 116 states and 427 transitions. [2019-01-20 10:05:59,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:05:59,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:05:59,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:05:59,483 INFO L225 Difference]: With dead ends: 116 [2019-01-20 10:05:59,483 INFO L226 Difference]: Without dead ends: 115 [2019-01-20 10:05:59,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:05:59,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-20 10:05:59,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 79. [2019-01-20 10:05:59,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-20 10:05:59,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 373 transitions. [2019-01-20 10:05:59,520 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 373 transitions. Word has length 6 [2019-01-20 10:05:59,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:05:59,520 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 373 transitions. [2019-01-20 10:05:59,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:05:59,520 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 373 transitions. [2019-01-20 10:05:59,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:05:59,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:05:59,521 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:05:59,521 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:05:59,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:59,521 INFO L82 PathProgramCache]: Analyzing trace with hash 904550232, now seen corresponding path program 1 times [2019-01-20 10:05:59,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:05:59,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:59,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:59,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:05:59,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:05:59,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:05:59,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:59,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:05:59,725 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:05:59,725 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [23] [2019-01-20 10:05:59,728 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:05:59,728 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:05:59,731 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:05:59,732 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:05:59,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:05:59,732 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:05:59,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:05:59,732 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:05:59,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:05:59,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:05:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:05:59,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:05:59,756 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-01-20 10:05:59,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,761 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-01-20 10:05:59,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,770 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-01-20 10:05:59,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,780 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-01-20 10:05:59,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,794 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-01-20 10:05:59,794 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:59,820 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:59,834 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:59,846 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:59,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:05:59,873 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-01-20 10:05:59,874 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:05:59,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:05:59,940 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-01-20 10:05:59,941 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:05:59,981 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-01-20 10:05:59,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:00,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,020 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-01-20 10:06:00,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:00,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-01-20 10:06:00,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:00,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,115 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:00,116 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 104 [2019-01-20 10:06:00,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:00,168 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-01-20 10:06:00,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:00,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,269 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:00,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:00,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, 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-01-20 10:06:00,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:00,334 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-01-20 10:06:00,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:06:00,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:00,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:00,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:00,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:06:00,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:00,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:06:00,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:06:00,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:06:00,435 INFO L87 Difference]: Start difference. First operand 79 states and 373 transitions. Second operand 12 states. [2019-01-20 10:06:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:01,436 INFO L93 Difference]: Finished difference Result 140 states and 516 transitions. [2019-01-20 10:06:01,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:01,436 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:06:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:01,438 INFO L225 Difference]: With dead ends: 140 [2019-01-20 10:06:01,438 INFO L226 Difference]: Without dead ends: 139 [2019-01-20 10:06:01,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:01,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-20 10:06:01,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 76. [2019-01-20 10:06:01,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-20 10:06:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 355 transitions. [2019-01-20 10:06:01,486 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 355 transitions. Word has length 6 [2019-01-20 10:06:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:01,486 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 355 transitions. [2019-01-20 10:06:01,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:06:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 355 transitions. [2019-01-20 10:06:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:01,487 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:01,487 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:01,487 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:01,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:01,487 INFO L82 PathProgramCache]: Analyzing trace with hash 904568030, now seen corresponding path program 1 times [2019-01-20 10:06:01,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:01,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:01,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:01,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:01,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:01,644 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 13 [2019-01-20 10:06:01,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:01,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:01,652 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:01,652 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:06:01,653 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [27] [2019-01-20 10:06:01,653 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:01,653 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:01,656 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:01,656 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:06:01,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:01,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:01,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:01,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:01,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:01,671 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:01,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:01,680 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-01-20 10:06:01,683 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-01-20 10:06:01,695 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-01-20 10:06:01,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-20 10:06:01,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-20 10:06:01,721 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:01,735 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:01,745 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:01,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:01,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:01,779 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-01-20 10:06:01,779 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-20 10:06:01,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,806 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-01-20 10:06:01,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:01,822 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-01-20 10:06:01,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:06:01,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:01,841 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-01-20 10:06:01,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:01,861 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-01-20 10:06:01,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-20 10:06:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:01,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:01,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:01,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:06:01,904 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:01,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:06:01,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:06:01,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:06:01,904 INFO L87 Difference]: Start difference. First operand 76 states and 355 transitions. Second operand 8 states. [2019-01-20 10:06:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:02,158 INFO L93 Difference]: Finished difference Result 112 states and 470 transitions. [2019-01-20 10:06:02,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:06:02,159 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:06:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:02,160 INFO L225 Difference]: With dead ends: 112 [2019-01-20 10:06:02,160 INFO L226 Difference]: Without dead ends: 111 [2019-01-20 10:06:02,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:06:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-20 10:06:02,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 80. [2019-01-20 10:06:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-20 10:06:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 380 transitions. [2019-01-20 10:06:02,196 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 380 transitions. Word has length 6 [2019-01-20 10:06:02,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:02,196 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 380 transitions. [2019-01-20 10:06:02,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:06:02,196 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 380 transitions. [2019-01-20 10:06:02,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:02,196 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:02,197 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:02,197 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:02,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:02,197 INFO L82 PathProgramCache]: Analyzing trace with hash 906170478, now seen corresponding path program 2 times [2019-01-20 10:06:02,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:02,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:02,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:02,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:02,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:02,351 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-20 10:06:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:02,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:02,435 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:02,435 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:02,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:02,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:02,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:02,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:02,447 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:02,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:06:02,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:02,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:02,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 18 treesize of output 21 [2019-01-20 10:06:02,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,462 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-01-20 10:06:02,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,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 23 treesize of output 37 [2019-01-20 10:06:02,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,475 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-01-20 10:06:02,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,484 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-01-20 10:06:02,485 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:02,511 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:02,526 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:02,538 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:02,548 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:02,566 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-01-20 10:06:02,566 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:02,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,613 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-01-20 10:06:02,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:02,655 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-01-20 10:06:02,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:02,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,695 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:02,695 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-01-20 10:06:02,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:02,738 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-01-20 10:06:02,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:02,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,778 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-01-20 10:06:02,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:02,822 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-01-20 10:06:02,823 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:02,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,861 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:02,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:02,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, 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-01-20 10:06:02,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:02,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-01-20 10:06:02,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:06:03,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:03,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:03,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:03,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:03,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:06:03,094 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:03,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:06:03,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:06:03,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:06:03,095 INFO L87 Difference]: Start difference. First operand 80 states and 380 transitions. Second operand 12 states. [2019-01-20 10:06:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:03,975 INFO L93 Difference]: Finished difference Result 137 states and 479 transitions. [2019-01-20 10:06:03,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:03,976 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:06:03,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:03,978 INFO L225 Difference]: With dead ends: 137 [2019-01-20 10:06:03,978 INFO L226 Difference]: Without dead ends: 135 [2019-01-20 10:06:03,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:03,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-01-20 10:06:04,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 77. [2019-01-20 10:06:04,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-20 10:06:04,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 361 transitions. [2019-01-20 10:06:04,015 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 361 transitions. Word has length 6 [2019-01-20 10:06:04,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:04,015 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 361 transitions. [2019-01-20 10:06:04,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:06:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 361 transitions. [2019-01-20 10:06:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:04,016 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:04,016 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:04,016 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:04,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:04,017 INFO L82 PathProgramCache]: Analyzing trace with hash 906163226, now seen corresponding path program 1 times [2019-01-20 10:06:04,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:04,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:04,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:04,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:04,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:04,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:04,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:04,141 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:06:04,141 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [25] [2019-01-20 10:06:04,142 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:04,142 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:04,144 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:04,144 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:06:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:04,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:04,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:04,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:04,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:04,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:04,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:04,162 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-01-20 10:06:04,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,168 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-01-20 10:06:04,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,175 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-01-20 10:06:04,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,182 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-01-20 10:06:04,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,201 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-01-20 10:06:04,202 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:04,228 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:04,243 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:04,255 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:04,265 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:04,283 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-01-20 10:06:04,283 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:04,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,314 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-01-20 10:06:04,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:04,354 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-01-20 10:06:04,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:04,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,410 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:04,412 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-01-20 10:06:04,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:04,499 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-01-20 10:06:04,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:04,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:04,541 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-01-20 10:06:04,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:04,591 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-01-20 10:06:04,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:04,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:04,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:04,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:04,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:06:04,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:04,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:06:04,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:06:04,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:06:04,662 INFO L87 Difference]: Start difference. First operand 77 states and 361 transitions. Second operand 10 states. [2019-01-20 10:06:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:05,132 INFO L93 Difference]: Finished difference Result 124 states and 454 transitions. [2019-01-20 10:06:05,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:05,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:06:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:05,134 INFO L225 Difference]: With dead ends: 124 [2019-01-20 10:06:05,135 INFO L226 Difference]: Without dead ends: 123 [2019-01-20 10:06:05,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:06:05,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-20 10:06:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 84. [2019-01-20 10:06:05,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-20 10:06:05,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 403 transitions. [2019-01-20 10:06:05,177 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 403 transitions. Word has length 6 [2019-01-20 10:06:05,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:05,177 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 403 transitions. [2019-01-20 10:06:05,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:06:05,177 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 403 transitions. [2019-01-20 10:06:05,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:05,177 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:05,177 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:05,178 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:05,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:05,178 INFO L82 PathProgramCache]: Analyzing trace with hash 906167070, now seen corresponding path program 1 times [2019-01-20 10:06:05,178 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:05,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:05,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:05,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:05,179 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:05,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:05,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:05,304 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:06:05,304 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [25] [2019-01-20 10:06:05,305 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:05,305 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:05,307 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:05,307 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:06:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:05,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:05,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:05,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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:05,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:05,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:05,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:05,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:05,326 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-01-20 10:06:05,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,331 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-01-20 10:06:05,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,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, 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-01-20 10:06:05,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,345 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-01-20 10:06:05,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,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, 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-01-20 10:06:05,354 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:05,381 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:05,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:05,407 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:05,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:05,437 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-01-20 10:06:05,437 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:05,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,474 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-01-20 10:06:05,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:05,518 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-01-20 10:06:05,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:05,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,552 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:05,553 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-01-20 10:06:05,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:05,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-01-20 10:06:05,597 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:05,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:05,633 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:05,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, 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-01-20 10:06:05,634 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:05,678 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-01-20 10:06:05,678 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:05,700 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:05,700 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:05,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:05,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:06:05,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:05,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:06:05,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:06:05,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:06:05,777 INFO L87 Difference]: Start difference. First operand 84 states and 403 transitions. Second operand 9 states. [2019-01-20 10:06:06,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:06,342 INFO L93 Difference]: Finished difference Result 119 states and 475 transitions. [2019-01-20 10:06:06,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:06:06,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:06:06,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:06,344 INFO L225 Difference]: With dead ends: 119 [2019-01-20 10:06:06,344 INFO L226 Difference]: Without dead ends: 118 [2019-01-20 10:06:06,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 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-01-20 10:06:06,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-20 10:06:06,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2019-01-20 10:06:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-20 10:06:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 445 transitions. [2019-01-20 10:06:06,391 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 445 transitions. Word has length 6 [2019-01-20 10:06:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:06,391 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 445 transitions. [2019-01-20 10:06:06,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:06:06,391 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 445 transitions. [2019-01-20 10:06:06,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:06,392 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:06,392 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:06,392 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:06,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:06,393 INFO L82 PathProgramCache]: Analyzing trace with hash 906285674, now seen corresponding path program 1 times [2019-01-20 10:06:06,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:06,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:06,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:06,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:06,394 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:06,538 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:06,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:06,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:06,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:06:06,539 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [23] [2019-01-20 10:06:06,539 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:06,540 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:06,542 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:06,542 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:06:06,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:06,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:06,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:06,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:06,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:06,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:06,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:06,566 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-01-20 10:06:06,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,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, 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-01-20 10:06:06,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,573 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-01-20 10:06:06,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,580 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-01-20 10:06:06,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,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, 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-01-20 10:06:06,586 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:06,614 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:06,629 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:06,641 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:06,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:06,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-01-20 10:06:06,668 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:06,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,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, 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-01-20 10:06:06,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06: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-01-20 10:06:06,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:06,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,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, 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-01-20 10:06:06,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:06,825 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-01-20 10:06:06,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:06,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,862 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:06,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, 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-01-20 10:06:06,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:06,908 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-01-20 10:06:06,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:06,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:06,960 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:06,961 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-01-20 10:06:06,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:07,009 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-01-20 10:06:07,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:07,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:07,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:07,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:06:07,096 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:07,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:06:07,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:06:07,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=143, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:06:07,096 INFO L87 Difference]: Start difference. First operand 91 states and 445 transitions. Second operand 12 states. [2019-01-20 10:06:08,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:08,077 INFO L93 Difference]: Finished difference Result 149 states and 594 transitions. [2019-01-20 10:06:08,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:08,077 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:06:08,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:08,079 INFO L225 Difference]: With dead ends: 149 [2019-01-20 10:06:08,079 INFO L226 Difference]: Without dead ends: 148 [2019-01-20 10:06:08,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=209, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:06:08,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-20 10:06:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 98. [2019-01-20 10:06:08,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-20 10:06:08,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 487 transitions. [2019-01-20 10:06:08,136 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 487 transitions. Word has length 6 [2019-01-20 10:06:08,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:08,136 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 487 transitions. [2019-01-20 10:06:08,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:06:08,137 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 487 transitions. [2019-01-20 10:06:08,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:08,137 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:08,137 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:08,138 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:08,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:08,138 INFO L82 PathProgramCache]: Analyzing trace with hash 906286234, now seen corresponding path program 1 times [2019-01-20 10:06:08,138 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:08,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:08,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:08,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:08,139 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:08,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:08,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:08,251 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:08,251 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:06:08,251 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [25] [2019-01-20 10:06:08,252 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:08,252 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:08,254 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:08,254 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:06:08,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:08,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:08,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:08,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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:08,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:08,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:08,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:08,275 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-01-20 10:06:08,278 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-01-20 10:06:08,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:06:08,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,299 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:06:08,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,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, 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-01-20 10:06:08,322 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:08,342 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:08,353 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:08,362 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:08,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:08,388 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-01-20 10:06:08,388 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:06:08,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,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, 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-01-20 10:06:08,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:08,453 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-01-20 10:06:08,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:08,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,482 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-01-20 10:06:08,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:08,512 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-01-20 10:06:08,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:08,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:08,539 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:08,540 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-01-20 10:06:08,540 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:08,571 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-01-20 10:06:08,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:06:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:08,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:08,618 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:08,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:08,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:06:08,637 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:08,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:06:08,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:06:08,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:06:08,637 INFO L87 Difference]: Start difference. First operand 98 states and 487 transitions. Second operand 10 states. [2019-01-20 10:06:09,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:09,140 INFO L93 Difference]: Finished difference Result 139 states and 554 transitions. [2019-01-20 10:06:09,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:06:09,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:06:09,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:09,142 INFO L225 Difference]: With dead ends: 139 [2019-01-20 10:06:09,143 INFO L226 Difference]: Without dead ends: 138 [2019-01-20 10:06:09,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:06:09,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-20 10:06:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 101. [2019-01-20 10:06:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-20 10:06:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 505 transitions. [2019-01-20 10:06:09,197 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 505 transitions. Word has length 6 [2019-01-20 10:06:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:09,197 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 505 transitions. [2019-01-20 10:06:09,197 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:06:09,197 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 505 transitions. [2019-01-20 10:06:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:09,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:09,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:09,198 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:09,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:09,198 INFO L82 PathProgramCache]: Analyzing trace with hash 906397274, now seen corresponding path program 2 times [2019-01-20 10:06:09,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:09,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:09,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:09,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:09,199 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:09,358 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-20 10:06:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:09,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:09,436 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:09,436 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:09,436 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:09,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:09,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:09,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:09,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:09,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:06:09,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:09,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:09,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 18 treesize of output 21 [2019-01-20 10:06:09,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,461 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-01-20 10:06:09,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,465 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-01-20 10:06:09,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,470 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-01-20 10:06:09,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,477 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-01-20 10:06:09,478 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:09,507 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:09,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:09,530 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:09,540 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:09,558 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-01-20 10:06:09,558 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:09,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,596 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-01-20 10:06:09,596 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:09,636 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-01-20 10:06:09,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:09,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,676 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:09,676 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-01-20 10:06:09,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:09,719 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-01-20 10:06:09,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:09,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,758 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:09,759 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-01-20 10:06:09,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:09,802 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-01-20 10:06:09,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:09,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:09,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 36 treesize of output 86 [2019-01-20 10:06:09,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:09,889 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-01-20 10:06:09,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:09,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:09,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:09,971 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:09,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:09,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:06:09,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:09,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:06:09,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:06:09,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:06:09,990 INFO L87 Difference]: Start difference. First operand 101 states and 505 transitions. Second operand 12 states. [2019-01-20 10:06:10,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:10,775 INFO L93 Difference]: Finished difference Result 164 states and 623 transitions. [2019-01-20 10:06:10,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:10,775 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:06:10,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:10,777 INFO L225 Difference]: With dead ends: 164 [2019-01-20 10:06:10,777 INFO L226 Difference]: Without dead ends: 163 [2019-01-20 10:06:10,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:10,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-20 10:06:10,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 100. [2019-01-20 10:06:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-20 10:06:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 499 transitions. [2019-01-20 10:06:10,831 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 499 transitions. Word has length 6 [2019-01-20 10:06:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:10,831 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 499 transitions. [2019-01-20 10:06:10,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:06:10,832 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 499 transitions. [2019-01-20 10:06:10,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:10,832 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:10,832 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:10,832 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:10,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:10,832 INFO L82 PathProgramCache]: Analyzing trace with hash 893366614, now seen corresponding path program 1 times [2019-01-20 10:06:10,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:10,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:10,833 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:10,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:10,833 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:10,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-01-20 10:06:10,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:10,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:10,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:06:10,962 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [27] [2019-01-20 10:06:10,963 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:10,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:10,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:10,965 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:06:10,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:10,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:10,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:10,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:10,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:10,979 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:10,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:10,991 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-01-20 10:06:10,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:10,995 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-01-20 10:06:11,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,003 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-01-20 10:06:11,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,011 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-01-20 10:06:11,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,021 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-01-20 10:06:11,022 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:11,063 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:11,082 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:11,094 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:11,111 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:11,134 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-01-20 10:06:11,135 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:11,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,185 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-01-20 10:06:11,186 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:11,242 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-01-20 10:06:11,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:11,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,278 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-01-20 10:06:11,278 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:11,322 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-01-20 10:06:11,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:11,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:11,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:11,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:06:11,380 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:11,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:06:11,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:06:11,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:06:11,380 INFO L87 Difference]: Start difference. First operand 100 states and 499 transitions. Second operand 8 states. [2019-01-20 10:06:11,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:11,743 INFO L93 Difference]: Finished difference Result 122 states and 529 transitions. [2019-01-20 10:06:11,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:06:11,743 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:06:11,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:11,745 INFO L225 Difference]: With dead ends: 122 [2019-01-20 10:06:11,745 INFO L226 Difference]: Without dead ends: 121 [2019-01-20 10:06:11,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:06:11,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-20 10:06:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2019-01-20 10:06:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-20 10:06:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 511 transitions. [2019-01-20 10:06:11,800 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 511 transitions. Word has length 6 [2019-01-20 10:06:11,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:11,800 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 511 transitions. [2019-01-20 10:06:11,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:06:11,800 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 511 transitions. [2019-01-20 10:06:11,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:11,800 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:11,800 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:11,801 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:11,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:11,801 INFO L82 PathProgramCache]: Analyzing trace with hash 893472260, now seen corresponding path program 1 times [2019-01-20 10:06:11,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:11,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:11,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:11,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:11,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:11,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:11,946 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:11,946 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:06:11,946 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [25] [2019-01-20 10:06:11,946 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:11,947 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:11,948 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:11,948 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:06:11,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:11,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:11,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:11,949 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:11,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:11,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:11,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:11,970 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-01-20 10:06:11,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,974 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-01-20 10:06:11,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,978 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-01-20 10:06:11,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,982 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-01-20 10:06:11,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:11,988 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-01-20 10:06:11,988 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:12,017 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:12,032 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:12,044 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:12,054 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:12,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-01-20 10:06:12,073 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:12,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,105 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-01-20 10:06:12,106 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:12,146 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-01-20 10:06:12,146 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:12,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,182 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:12,182 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-01-20 10:06:12,183 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:12,228 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-01-20 10:06:12,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:12,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:12,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 36 treesize of output 86 [2019-01-20 10:06:12,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:12,317 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-01-20 10:06:12,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:12,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:12,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:12,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:06:12,384 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:12,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:06:12,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:06:12,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:06:12,385 INFO L87 Difference]: Start difference. First operand 102 states and 511 transitions. Second operand 10 states. [2019-01-20 10:06:12,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:12,945 INFO L93 Difference]: Finished difference Result 154 states and 624 transitions. [2019-01-20 10:06:12,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:12,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:06:12,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:12,947 INFO L225 Difference]: With dead ends: 154 [2019-01-20 10:06:12,947 INFO L226 Difference]: Without dead ends: 153 [2019-01-20 10:06:12,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:06:12,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-01-20 10:06:13,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 111. [2019-01-20 10:06:13,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-20 10:06:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-20 10:06:13,016 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-20 10:06:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:13,017 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-20 10:06:13,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:06:13,017 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-20 10:06:13,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:13,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:13,017 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:13,017 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:13,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:13,018 INFO L82 PathProgramCache]: Analyzing trace with hash 897358608, now seen corresponding path program 1 times [2019-01-20 10:06:13,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:13,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:13,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:13,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:13,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:13,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:13,560 WARN L181 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 17 [2019-01-20 10:06:13,637 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:13,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:13,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:13,637 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:06:13,637 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [27] [2019-01-20 10:06:13,638 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:13,638 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:13,640 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:13,640 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:06:13,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:13,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:13,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:13,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:13,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:13,649 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:13,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:13,656 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-01-20 10:06:13,660 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-01-20 10:06:13,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:06:13,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,673 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:06:13,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,682 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-01-20 10:06:13,682 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:13,702 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:13,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:13,722 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:13,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:13,749 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-01-20 10:06:13,750 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:06:13,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,780 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,785 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-01-20 10:06:13,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:13,811 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-01-20 10:06:13,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:13,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:13,839 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-01-20 10:06:13,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:13,870 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-01-20 10:06:13,870 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:06:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:13,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:13,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:13,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:13,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:06:13,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:13,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:06:13,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:06:13,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:06:13,941 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 8 states. [2019-01-20 10:06:14,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:14,262 INFO L93 Difference]: Finished difference Result 130 states and 583 transitions. [2019-01-20 10:06:14,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:06:14,272 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:06:14,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:14,273 INFO L225 Difference]: With dead ends: 130 [2019-01-20 10:06:14,273 INFO L226 Difference]: Without dead ends: 129 [2019-01-20 10:06:14,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:06:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-20 10:06:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-01-20 10:06:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-20 10:06:14,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 566 transitions. [2019-01-20 10:06:14,347 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 566 transitions. Word has length 6 [2019-01-20 10:06:14,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:14,347 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 566 transitions. [2019-01-20 10:06:14,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:06:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 566 transitions. [2019-01-20 10:06:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:14,348 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:14,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:14,348 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:14,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:14,349 INFO L82 PathProgramCache]: Analyzing trace with hash 896931860, now seen corresponding path program 2 times [2019-01-20 10:06:14,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:14,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:14,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:14,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:14,350 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:14,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:14,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:14,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:14,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:14,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:14,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:14,514 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:14,514 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:14,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:06:14,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:14,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:14,523 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-01-20 10:06:14,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,525 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-01-20 10:06:14,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,531 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-01-20 10:06:14,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,541 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-01-20 10:06:14,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,548 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-01-20 10:06:14,549 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:14,577 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:14,592 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:14,602 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:14,612 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:14,629 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-01-20 10:06:14,629 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:14,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,664 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-01-20 10:06:14,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:14,720 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-01-20 10:06:14,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:14,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,776 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-01-20 10:06:14,777 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:14,822 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-01-20 10:06:14,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:14,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:14,862 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:14,863 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-01-20 10:06:14,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:14,910 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-01-20 10:06:14,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:14,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:14,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:14,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:06:14,982 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:14,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:06:14,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:06:14,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:06:14,983 INFO L87 Difference]: Start difference. First operand 111 states and 566 transitions. Second operand 9 states. [2019-01-20 10:06:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:15,493 INFO L93 Difference]: Finished difference Result 160 states and 682 transitions. [2019-01-20 10:06:15,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:06:15,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-20 10:06:15,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:15,496 INFO L225 Difference]: With dead ends: 160 [2019-01-20 10:06:15,496 INFO L226 Difference]: Without dead ends: 159 [2019-01-20 10:06:15,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:06:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-20 10:06:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 117. [2019-01-20 10:06:15,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-20 10:06:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 603 transitions. [2019-01-20 10:06:15,565 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 603 transitions. Word has length 6 [2019-01-20 10:06:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:15,565 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 603 transitions. [2019-01-20 10:06:15,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:06:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 603 transitions. [2019-01-20 10:06:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:15,566 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:15,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:15,566 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:15,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:15,566 INFO L82 PathProgramCache]: Analyzing trace with hash 897479758, now seen corresponding path program 1 times [2019-01-20 10:06:15,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:15,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:15,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:15,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:15,567 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:15,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:15,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:15,662 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:15,662 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:06:15,663 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [26], [28], [29] [2019-01-20 10:06:15,664 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:15,664 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:15,666 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:15,667 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:06:15,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:15,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:15,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:15,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:15,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:15,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:15,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:15,688 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-01-20 10:06:15,696 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-01-20 10:06:15,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:06:15,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:06:15,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,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, 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-01-20 10:06:15,732 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:15,752 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:15,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:15,774 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:15,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:15,800 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-01-20 10:06:15,801 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-20 10:06:15,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:15,839 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-01-20 10:06:15,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:15,867 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-01-20 10:06:15,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:15,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:15,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:06:15,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 6 [2019-01-20 10:06:15,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:06:15,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:06:15,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:06:15,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:06:15,911 INFO L87 Difference]: Start difference. First operand 117 states and 603 transitions. Second operand 4 states. [2019-01-20 10:06:16,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:16,007 INFO L93 Difference]: Finished difference Result 121 states and 607 transitions. [2019-01-20 10:06:16,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:06:16,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-01-20 10:06:16,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:16,009 INFO L225 Difference]: With dead ends: 121 [2019-01-20 10:06:16,009 INFO L226 Difference]: Without dead ends: 117 [2019-01-20 10:06:16,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:06:16,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-20 10:06:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-01-20 10:06:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-20 10:06:16,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 599 transitions. [2019-01-20 10:06:16,076 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 599 transitions. Word has length 6 [2019-01-20 10:06:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:16,076 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 599 transitions. [2019-01-20 10:06:16,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:06:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 599 transitions. [2019-01-20 10:06:16,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:16,076 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:16,076 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:16,077 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:16,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:16,077 INFO L82 PathProgramCache]: Analyzing trace with hash 897162312, now seen corresponding path program 2 times [2019-01-20 10:06:16,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:16,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:16,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:16,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:16,280 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 21 [2019-01-20 10:06:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:16,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:16,393 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:16,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:16,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:16,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:16,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:16,403 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:16,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:16,411 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:06:16,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:16,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:16,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, 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-01-20 10:06:16,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,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-01-20 10:06:16,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,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 23 treesize of output 37 [2019-01-20 10:06:16,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,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, 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-01-20 10:06:16,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,436 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-01-20 10:06:16,436 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:16,465 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:16,480 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:16,492 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:16,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:16,521 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-01-20 10:06:16,521 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:16,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,558 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-01-20 10:06:16,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:16,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-01-20 10:06:16,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:16,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,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, 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-01-20 10:06:16,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:16,687 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-01-20 10:06:16,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:16,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,727 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:16,728 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 104 [2019-01-20 10:06:16,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:16,776 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-01-20 10:06:16,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:16,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:16,942 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:16,942 INFO L303 Elim1Store]: Index analysis took 143 ms [2019-01-20 10:06:16,943 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 99 [2019-01-20 10:06:16,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:17,088 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-01-20 10:06:17,089 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:17,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:17,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:17,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:06:17,184 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:17,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:06:17,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:06:17,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:06:17,185 INFO L87 Difference]: Start difference. First operand 114 states and 599 transitions. Second operand 12 states. [2019-01-20 10:06:18,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:18,100 INFO L93 Difference]: Finished difference Result 186 states and 791 transitions. [2019-01-20 10:06:18,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:18,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:06:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:18,103 INFO L225 Difference]: With dead ends: 186 [2019-01-20 10:06:18,103 INFO L226 Difference]: Without dead ends: 184 [2019-01-20 10:06:18,104 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-20 10:06:18,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 121. [2019-01-20 10:06:18,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-20 10:06:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 632 transitions. [2019-01-20 10:06:18,202 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 632 transitions. Word has length 6 [2019-01-20 10:06:18,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:18,203 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 632 transitions. [2019-01-20 10:06:18,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:06:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 632 transitions. [2019-01-20 10:06:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:18,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:18,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:18,203 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:18,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:18,204 INFO L82 PathProgramCache]: Analyzing trace with hash 897179862, now seen corresponding path program 1 times [2019-01-20 10:06:18,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:18,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:18,204 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:18,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:18,204 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:18,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:18,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:18,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-20 10:06:18,289 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [27] [2019-01-20 10:06:18,290 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:18,290 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:18,292 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:18,292 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 3. Performed 68 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:06:18,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:18,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:18,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:18,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:18,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:18,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:18,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:18,309 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-01-20 10:06:18,313 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-01-20 10:06:18,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:06:18,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,337 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:06:18,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,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, 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-01-20 10:06:18,351 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:18,369 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:18,379 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:18,389 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:18,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:18,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-01-20 10:06:18,416 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-20 10:06:18,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,454 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-01-20 10:06:18,454 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:18,481 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-01-20 10:06:18,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:18,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:18,508 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-01-20 10:06:18,508 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:18,540 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-01-20 10:06:18,541 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:06:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:18,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:18,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:18,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:18,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:06:18,590 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:18,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:06:18,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:06:18,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:06:18,591 INFO L87 Difference]: Start difference. First operand 121 states and 632 transitions. Second operand 8 states. [2019-01-20 10:06:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:18,944 INFO L93 Difference]: Finished difference Result 161 states and 745 transitions. [2019-01-20 10:06:18,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:06:18,944 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:06:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:18,946 INFO L225 Difference]: With dead ends: 161 [2019-01-20 10:06:18,947 INFO L226 Difference]: Without dead ends: 160 [2019-01-20 10:06:18,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:06:18,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-20 10:06:19,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 133. [2019-01-20 10:06:19,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-20 10:06:19,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 714 transitions. [2019-01-20 10:06:19,031 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 714 transitions. Word has length 6 [2019-01-20 10:06:19,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:19,031 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 714 transitions. [2019-01-20 10:06:19,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:06:19,031 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 714 transitions. [2019-01-20 10:06:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:19,032 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:19,032 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:19,032 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:19,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:19,032 INFO L82 PathProgramCache]: Analyzing trace with hash 900993110, now seen corresponding path program 2 times [2019-01-20 10:06:19,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:19,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:19,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:19,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:19,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:19,287 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 9 [2019-01-20 10:06:19,309 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:19,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:19,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:19,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:19,310 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:19,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:19,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:19,321 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:19,321 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:19,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:06:19,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:19,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:19,329 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-01-20 10:06:19,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-01-20 10:06:19,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, 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-01-20 10:06:19,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-20 10:06:19,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-20 10:06:19,362 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:19,376 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:19,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:19,395 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:19,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:19,418 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-01-20 10:06:19,418 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-20 10:06:19,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,448 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-01-20 10:06:19,449 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:19,465 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-01-20 10:06:19,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:06:19,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:19,488 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-01-20 10:06:19,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:19,505 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-01-20 10:06:19,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:06:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:19,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:19,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:19,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:06:19,556 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:19,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:06:19,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:06:19,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:06:19,557 INFO L87 Difference]: Start difference. First operand 133 states and 714 transitions. Second operand 8 states. [2019-01-20 10:06:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:19,887 INFO L93 Difference]: Finished difference Result 172 states and 801 transitions. [2019-01-20 10:06:19,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:06:19,888 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-20 10:06:19,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:19,890 INFO L225 Difference]: With dead ends: 172 [2019-01-20 10:06:19,890 INFO L226 Difference]: Without dead ends: 170 [2019-01-20 10:06:19,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:06:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-01-20 10:06:19,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 137. [2019-01-20 10:06:19,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-20 10:06:19,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 738 transitions. [2019-01-20 10:06:19,976 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 738 transitions. Word has length 6 [2019-01-20 10:06:19,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:19,977 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 738 transitions. [2019-01-20 10:06:19,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:06:19,977 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 738 transitions. [2019-01-20 10:06:19,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:19,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:19,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:19,978 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:19,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:19,978 INFO L82 PathProgramCache]: Analyzing trace with hash 900629352, now seen corresponding path program 3 times [2019-01-20 10:06:19,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:19,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:19,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:19,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:19,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:20,123 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-20 10:06:20,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:20,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:20,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:20,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:20,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:20,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:20,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:20,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:06:20,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:06:20,228 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:06:20,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:20,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:20,233 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-01-20 10:06:20,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,235 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-01-20 10:06:20,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,239 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-01-20 10:06:20,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,245 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-01-20 10:06:20,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,252 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-01-20 10:06:20,252 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:20,278 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:20,293 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:20,304 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:20,313 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:20,331 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-01-20 10:06:20,332 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:20,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,370 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-01-20 10:06:20,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:20,412 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-01-20 10:06:20,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:20,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,450 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:20,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, 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-01-20 10:06:20,452 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:20,493 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-01-20 10:06:20,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:20,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,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, 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-01-20 10:06:20,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:20,576 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-01-20 10:06:20,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:20,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,614 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:20,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:20,616 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-01-20 10:06:20,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:20,663 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-01-20 10:06:20,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:06:20,694 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:20,694 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:20,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:20,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:06:20,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:20,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:06:20,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:06:20,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:06:20,772 INFO L87 Difference]: Start difference. First operand 137 states and 738 transitions. Second operand 12 states. [2019-01-20 10:06:21,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:21,593 INFO L93 Difference]: Finished difference Result 209 states and 906 transitions. [2019-01-20 10:06:21,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:21,593 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-20 10:06:21,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:21,596 INFO L225 Difference]: With dead ends: 209 [2019-01-20 10:06:21,596 INFO L226 Difference]: Without dead ends: 207 [2019-01-20 10:06:21,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-20 10:06:21,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 123. [2019-01-20 10:06:21,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-20 10:06:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 652 transitions. [2019-01-20 10:06:21,685 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 652 transitions. Word has length 6 [2019-01-20 10:06:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:21,686 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 652 transitions. [2019-01-20 10:06:21,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:06:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 652 transitions. [2019-01-20 10:06:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-20 10:06:21,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:21,687 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-20 10:06:21,687 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:21,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash 900750874, now seen corresponding path program 2 times [2019-01-20 10:06:21,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:21,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:21,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:21,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:21,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:21,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:21,803 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:21,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:21,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:21,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:21,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:21,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:21,820 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:06:21,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:21,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:21,823 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-01-20 10:06:21,831 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-01-20 10:06:21,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,838 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:06:21,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,851 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:06:21,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,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, 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-01-20 10:06:21,860 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:21,878 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:21,889 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:21,899 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:21,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:21,924 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-01-20 10:06:21,924 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:06:21,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:21,957 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-01-20 10:06:21,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:21,983 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-01-20 10:06:21,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:21,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,009 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-01-20 10:06:22,009 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:22,040 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-01-20 10:06:22,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:22,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:22,106 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:22,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, 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-01-20 10:06:22,107 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:22,140 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-01-20 10:06:22,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:06:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:22,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:22,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:22,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:22,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:06:22,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:22,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:06:22,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:06:22,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:06:22,238 INFO L87 Difference]: Start difference. First operand 123 states and 652 transitions. Second operand 10 states. [2019-01-20 10:06:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:22,717 INFO L93 Difference]: Finished difference Result 180 states and 787 transitions. [2019-01-20 10:06:22,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:22,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-20 10:06:22,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:22,720 INFO L225 Difference]: With dead ends: 180 [2019-01-20 10:06:22,720 INFO L226 Difference]: Without dead ends: 173 [2019-01-20 10:06:22,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:06:22,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-01-20 10:06:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 134. [2019-01-20 10:06:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-20 10:06:22,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 703 transitions. [2019-01-20 10:06:22,813 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 703 transitions. Word has length 6 [2019-01-20 10:06:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:22,813 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 703 transitions. [2019-01-20 10:06:22,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:06:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 703 transitions. [2019-01-20 10:06:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:22,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:22,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:22,814 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:22,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:22,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2018172698, now seen corresponding path program 1 times [2019-01-20 10:06:22,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:22,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:22,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:22,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:22,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:23,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:23,009 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:23,009 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:23,009 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [25] [2019-01-20 10:06:23,009 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:23,010 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:23,012 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:23,012 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:06:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:23,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:23,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:23,013 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:23,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:23,028 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:23,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:23,037 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-01-20 10:06:23,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,041 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-01-20 10:06:23,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,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, 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-01-20 10:06:23,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,057 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-01-20 10:06:23,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,068 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-01-20 10:06:23,069 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:23,108 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:23,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:23,133 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:23,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:23,161 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-01-20 10:06:23,161 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:23,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,196 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-01-20 10:06:23,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:23,236 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-01-20 10:06:23,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:23,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,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 38 treesize of output 80 [2019-01-20 10:06:23,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:23,312 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-01-20 10:06:23,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:23,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,352 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:23,353 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-01-20 10:06:23,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:23,401 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-01-20 10:06:23,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:23,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,437 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:23,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:23,439 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-01-20 10:06:23,440 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:23,487 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-01-20 10:06:23,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:06:23,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:23,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:23,710 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:23,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:23,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:06:23,730 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:23,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:06:23,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:06:23,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:06:23,731 INFO L87 Difference]: Start difference. First operand 134 states and 703 transitions. Second operand 12 states. [2019-01-20 10:06:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:24,545 INFO L93 Difference]: Finished difference Result 189 states and 804 transitions. [2019-01-20 10:06:24,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:06:24,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:06:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:24,547 INFO L225 Difference]: With dead ends: 189 [2019-01-20 10:06:24,548 INFO L226 Difference]: Without dead ends: 188 [2019-01-20 10:06:24,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-01-20 10:06:24,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 133. [2019-01-20 10:06:24,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-01-20 10:06:24,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 697 transitions. [2019-01-20 10:06:24,643 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 697 transitions. Word has length 7 [2019-01-20 10:06:24,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:24,643 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 697 transitions. [2019-01-20 10:06:24,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:06:24,644 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 697 transitions. [2019-01-20 10:06:24,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:24,644 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:24,644 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:24,644 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:24,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:24,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2018168854, now seen corresponding path program 1 times [2019-01-20 10:06:24,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:24,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:24,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:24,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:24,645 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:24,821 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-01-20 10:06:24,917 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:24,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:24,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:24,918 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:24,918 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [25] [2019-01-20 10:06:24,922 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:24,922 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:24,924 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:24,925 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:06:24,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:24,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:24,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:24,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:24,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:24,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:24,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:24,953 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-01-20 10:06:24,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:24,957 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-01-20 10:06:24,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:24,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:24,971 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-01-20 10:06:24,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:24,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:24,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:24,984 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-01-20 10:06:24,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:24,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:24,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:24,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:24,989 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-01-20 10:06:24,990 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:25,032 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:25,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:25,058 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:25,068 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:25,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:25,086 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:25,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,124 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-01-20 10:06:25,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:25,162 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-01-20 10:06:25,163 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:25,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,200 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-01-20 10:06:25,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:25,243 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-01-20 10:06:25,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:25,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,285 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:25,286 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-01-20 10:06:25,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:25,332 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-01-20 10:06:25,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:25,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:25,374 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:25,375 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-01-20 10:06:25,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:25,421 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-01-20 10:06:25,421 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:25,444 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:25,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:25,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:25,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:06:25,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:25,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:06:25,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:06:25,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:06:25,521 INFO L87 Difference]: Start difference. First operand 133 states and 697 transitions. Second operand 11 states. [2019-01-20 10:06:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:26,312 INFO L93 Difference]: Finished difference Result 169 states and 746 transitions. [2019-01-20 10:06:26,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:06:26,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:06:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:26,314 INFO L225 Difference]: With dead ends: 169 [2019-01-20 10:06:26,314 INFO L226 Difference]: Without dead ends: 168 [2019-01-20 10:06:26,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=249, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:26,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-01-20 10:06:26,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 132. [2019-01-20 10:06:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-20 10:06:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 691 transitions. [2019-01-20 10:06:26,435 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 691 transitions. Word has length 7 [2019-01-20 10:06:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:26,435 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 691 transitions. [2019-01-20 10:06:26,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:06:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 691 transitions. [2019-01-20 10:06:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:26,436 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:26,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:26,436 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:26,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2017620956, now seen corresponding path program 1 times [2019-01-20 10:06:26,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:26,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:26,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:26,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:26,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:26,616 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 9 [2019-01-20 10:06:26,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:26,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:26,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:26,641 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:26,641 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [29] [2019-01-20 10:06:26,642 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:26,642 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:26,644 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:26,644 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:06:26,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:26,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:26,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:26,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:26,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:26,653 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:26,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:26,664 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-01-20 10:06:26,666 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-01-20 10:06:26,672 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-01-20 10:06:26,683 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-01-20 10:06:26,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06: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, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-20 10:06:26,694 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:26,704 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:26,713 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:26,764 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:26,773 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:26,785 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-01-20 10:06:26,785 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-20 10:06:26,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:26,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:26,809 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-01-20 10:06:26,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:26,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:26,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-20 10:06:26,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:26,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:26,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:26,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:26,844 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-01-20 10:06:26,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:26,853 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-01-20 10:06:26,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:16 [2019-01-20 10:06:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:26,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:26,882 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:26,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:26,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:06:26,900 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:26,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:06:26,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:06:26,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:06:26,901 INFO L87 Difference]: Start difference. First operand 132 states and 691 transitions. Second operand 8 states. [2019-01-20 10:06:27,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:27,178 INFO L93 Difference]: Finished difference Result 159 states and 727 transitions. [2019-01-20 10:06:27,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:06:27,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:06:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:27,180 INFO L225 Difference]: With dead ends: 159 [2019-01-20 10:06:27,181 INFO L226 Difference]: Without dead ends: 158 [2019-01-20 10:06:27,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:06:27,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-01-20 10:06:27,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 136. [2019-01-20 10:06:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-20 10:06:27,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 706 transitions. [2019-01-20 10:06:27,271 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 706 transitions. Word has length 7 [2019-01-20 10:06:27,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:27,271 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 706 transitions. [2019-01-20 10:06:27,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:06:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 706 transitions. [2019-01-20 10:06:27,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:27,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:27,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:27,272 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:27,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:27,272 INFO L82 PathProgramCache]: Analyzing trace with hash -2018050250, now seen corresponding path program 1 times [2019-01-20 10:06:27,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:27,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:27,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:27,273 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:27,447 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-01-20 10:06:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:27,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:27,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:27,566 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:27,566 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [23] [2019-01-20 10:06:27,567 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:27,567 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:27,569 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:27,569 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:06:27,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:27,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:27,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:27,570 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:27,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:27,580 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:27,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:27,588 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-01-20 10:06:27,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,594 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-01-20 10:06:27,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,599 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-01-20 10:06:27,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,634 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-01-20 10:06:27,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,641 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-01-20 10:06:27,641 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:27,668 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:27,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:27,692 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:27,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:27,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:27,721 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:27,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,755 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-01-20 10:06:27,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:27,790 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-01-20 10:06:27,790 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:27,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,829 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-01-20 10:06:27,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:27,873 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-01-20 10:06:27,873 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:27,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,911 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:27,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,913 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-01-20 10:06:27,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:27,961 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-01-20 10:06:27,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-20 10:06:27,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:27,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,001 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:28,002 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 100 [2019-01-20 10:06:28,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:28,048 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-01-20 10:06:28,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:06:28,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:28,112 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:28,112 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-01-20 10:06:28,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:28,159 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-01-20 10:06:28,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:06:28,179 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:28,179 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:28,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:28,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-20 10:06:28,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:28,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:06:28,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:06:28,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=212, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:06:28,268 INFO L87 Difference]: Start difference. First operand 136 states and 706 transitions. Second operand 14 states. [2019-01-20 10:06:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:29,511 INFO L93 Difference]: Finished difference Result 199 states and 872 transitions. [2019-01-20 10:06:29,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:06:29,512 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-20 10:06:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:29,514 INFO L225 Difference]: With dead ends: 199 [2019-01-20 10:06:29,514 INFO L226 Difference]: Without dead ends: 198 [2019-01-20 10:06:29,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:06:29,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-20 10:06:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 134. [2019-01-20 10:06:29,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-20 10:06:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-20 10:06:29,613 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-20 10:06:29,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:29,614 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-20 10:06:29,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:06:29,614 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-20 10:06:29,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:29,614 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:29,614 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:29,614 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:29,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:29,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2018049690, now seen corresponding path program 1 times [2019-01-20 10:06:29,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:29,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:29,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:29,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:29,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:29,792 WARN L181 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-20 10:06:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:29,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:29,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:29,866 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:29,866 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [25] [2019-01-20 10:06:29,867 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:29,867 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:29,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:29,869 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:06:29,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:29,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:29,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:29,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:29,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:29,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:29,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:29,885 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-01-20 10:06:29,889 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-01-20 10:06:29,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:29,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:06:29,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:29,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:29,902 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:06:29,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:29,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:29,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:29,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, 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-01-20 10:06:29,914 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:29,933 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:29,944 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:29,953 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:29,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:29,979 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-01-20 10:06:29,979 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-20 10:06:30,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,022 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-01-20 10:06:30,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:30,048 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-01-20 10:06:30,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:30,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,079 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-01-20 10:06:30,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:30,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-01-20 10:06:30,109 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:06:30,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,140 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:30,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,141 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-01-20 10:06:30,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:30,169 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-01-20 10:06:30,169 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-20 10:06:30,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:30,199 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:30,200 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-01-20 10:06:30,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:30,233 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-01-20 10:06:30,233 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:06:30,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:30,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:30,304 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:30,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:30,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:06:30,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:30,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:06:30,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:06:30,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:06:30,323 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 12 states. [2019-01-20 10:06:30,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:30,977 INFO L93 Difference]: Finished difference Result 181 states and 747 transitions. [2019-01-20 10:06:30,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:30,977 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:06:30,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:30,979 INFO L225 Difference]: With dead ends: 181 [2019-01-20 10:06:30,980 INFO L226 Difference]: Without dead ends: 180 [2019-01-20 10:06:30,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-01-20 10:06:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 134. [2019-01-20 10:06:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-20 10:06:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 693 transitions. [2019-01-20 10:06:31,084 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 693 transitions. Word has length 7 [2019-01-20 10:06:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:31,084 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 693 transitions. [2019-01-20 10:06:31,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:06:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 693 transitions. [2019-01-20 10:06:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:31,085 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:31,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:31,085 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:31,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:31,085 INFO L82 PathProgramCache]: Analyzing trace with hash -2017938650, now seen corresponding path program 2 times [2019-01-20 10:06:31,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:31,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:31,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:31,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:31,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:31,801 WARN L181 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-01-20 10:06:31,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:31,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:31,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:31,925 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:31,925 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:31,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:31,925 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:31,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:31,934 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:31,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:06:31,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:31,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:31,950 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-01-20 10:06:31,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:31,953 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-01-20 10:06:31,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:31,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:31,956 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-01-20 10:06:31,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:31,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:31,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:31,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, 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-01-20 10:06:31,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:31,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:31,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:31,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:31,971 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-01-20 10:06:31,972 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:31,998 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:32,013 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:32,025 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:32,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:32,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:32,053 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:32,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,094 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-01-20 10:06:32,094 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:32,142 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-01-20 10:06:32,142 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:32,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,182 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-01-20 10:06:32,182 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:32,226 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-01-20 10:06:32,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:32,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,272 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:32,272 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-01-20 10:06:32,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:32,319 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-01-20 10:06:32,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:32,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,361 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:32,362 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-01-20 10:06:32,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:32,408 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-01-20 10:06:32,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:32,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,444 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:32,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:32,446 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-01-20 10:06:32,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:32,495 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-01-20 10:06:32,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:06:32,522 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:32,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:32,605 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:32,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:32,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-20 10:06:32,624 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:32,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:06:32,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:06:32,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=239, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:32,624 INFO L87 Difference]: Start difference. First operand 134 states and 693 transitions. Second operand 14 states. [2019-01-20 10:06:33,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:33,898 INFO L93 Difference]: Finished difference Result 200 states and 825 transitions. [2019-01-20 10:06:33,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:06:33,898 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-20 10:06:33,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:33,901 INFO L225 Difference]: With dead ends: 200 [2019-01-20 10:06:33,901 INFO L226 Difference]: Without dead ends: 199 [2019-01-20 10:06:33,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=191, Invalid=361, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:06:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-20 10:06:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 131. [2019-01-20 10:06:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-20 10:06:33,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 674 transitions. [2019-01-20 10:06:33,993 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 674 transitions. Word has length 7 [2019-01-20 10:06:33,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:33,993 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 674 transitions. [2019-01-20 10:06:33,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:06:33,993 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 674 transitions. [2019-01-20 10:06:33,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:33,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:33,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:33,994 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:33,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:33,994 INFO L82 PathProgramCache]: Analyzing trace with hash -2030969310, now seen corresponding path program 1 times [2019-01-20 10:06:33,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:33,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:33,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:33,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:33,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:34,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:34,164 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:34,164 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:34,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:34,165 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [27] [2019-01-20 10:06:34,165 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:34,165 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:34,167 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:34,167 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:06:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:34,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:34,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:34,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:34,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:34,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:34,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:34,190 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-01-20 10:06:34,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,194 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-01-20 10:06:34,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,201 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-01-20 10:06:34,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,208 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-01-20 10:06:34,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,219 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-01-20 10:06:34,219 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:34,247 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:34,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:34,272 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:34,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:34,299 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-01-20 10:06:34,300 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:34,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,334 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-01-20 10:06:34,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:34,371 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-01-20 10:06:34,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:34,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,408 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-01-20 10:06:34,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:34,469 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-01-20 10:06:34,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:34,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,516 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:34,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:34,518 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-01-20 10:06:34,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:34,641 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-01-20 10:06:34,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:06:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:34,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:34,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:34,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:34,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:06:34,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:34,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:06:34,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:06:34,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:06:34,721 INFO L87 Difference]: Start difference. First operand 131 states and 674 transitions. Second operand 10 states. [2019-01-20 10:06:35,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:35,249 INFO L93 Difference]: Finished difference Result 160 states and 731 transitions. [2019-01-20 10:06:35,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:06:35,249 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:06:35,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:35,251 INFO L225 Difference]: With dead ends: 160 [2019-01-20 10:06:35,251 INFO L226 Difference]: Without dead ends: 159 [2019-01-20 10:06:35,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:06:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-20 10:06:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 137. [2019-01-20 10:06:35,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-20 10:06:35,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 710 transitions. [2019-01-20 10:06:35,360 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 710 transitions. Word has length 7 [2019-01-20 10:06:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:35,360 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 710 transitions. [2019-01-20 10:06:35,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:06:35,360 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 710 transitions. [2019-01-20 10:06:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:35,360 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:35,361 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:35,361 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:35,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:35,361 INFO L82 PathProgramCache]: Analyzing trace with hash -2030863664, now seen corresponding path program 1 times [2019-01-20 10:06:35,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:35,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:35,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:35,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:35,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:35,492 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:35,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:35,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:35,493 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:35,493 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [25] [2019-01-20 10:06:35,494 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:35,494 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:35,496 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:35,496 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:06:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:35,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:35,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:35,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:35,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:35,513 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:35,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:35,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:35,528 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-01-20 10:06:35,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,532 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-01-20 10:06:35,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,539 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-01-20 10:06:35,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,561 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-01-20 10:06:35,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,568 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-01-20 10:06:35,568 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:35,595 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:35,610 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:35,621 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:35,631 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:35,649 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-01-20 10:06:35,649 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:35,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,687 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-01-20 10:06:35,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:35,727 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-01-20 10:06:35,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:35,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,764 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-01-20 10:06:35,765 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:35,812 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-01-20 10:06:35,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:35,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,852 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:35,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 38 treesize of output 104 [2019-01-20 10:06:35,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:35,904 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-01-20 10:06:35,905 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:35,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,948 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:35,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:35,950 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-01-20 10:06:35,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:35,998 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-01-20 10:06:35,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:06:36,020 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:36,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:36,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:36,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:36,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:06:36,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:36,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:06:36,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:06:36,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:06:36,088 INFO L87 Difference]: Start difference. First operand 137 states and 710 transitions. Second operand 11 states. [2019-01-20 10:06:36,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:36,954 INFO L93 Difference]: Finished difference Result 197 states and 846 transitions. [2019-01-20 10:06:36,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:36,955 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:06:36,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:36,957 INFO L225 Difference]: With dead ends: 197 [2019-01-20 10:06:36,957 INFO L226 Difference]: Without dead ends: 196 [2019-01-20 10:06:36,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:06:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-01-20 10:06:37,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 140. [2019-01-20 10:06:37,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-01-20 10:06:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 728 transitions. [2019-01-20 10:06:37,066 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 728 transitions. Word has length 7 [2019-01-20 10:06:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:37,067 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 728 transitions. [2019-01-20 10:06:37,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:06:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 728 transitions. [2019-01-20 10:06:37,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:37,067 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:37,067 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:37,068 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:37,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:37,068 INFO L82 PathProgramCache]: Analyzing trace with hash -2026994678, now seen corresponding path program 2 times [2019-01-20 10:06:37,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:37,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:37,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:37,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:37,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:37,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:37,238 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:37,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:37,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:37,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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:37,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:37,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:37,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:06:37,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:37,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:37,256 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-01-20 10:06:37,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,262 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-01-20 10:06:37,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,265 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-01-20 10:06:37,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,278 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-01-20 10:06:37,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,284 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-01-20 10:06:37,284 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:37,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:37,326 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:37,337 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:37,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:37,365 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-01-20 10:06:37,365 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:37,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,403 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-01-20 10:06:37,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:37,445 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-01-20 10:06:37,445 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:37,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,480 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:37,480 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-01-20 10:06:37,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:37,523 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-01-20 10:06:37,524 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-20 10:06:37,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,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, 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-01-20 10:06:37,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:37,603 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-01-20 10:06:37,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-20 10:06:37,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:37,646 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:37,647 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-01-20 10:06:37,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:37,695 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-01-20 10:06:37,695 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:06:37,716 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:37,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:37,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:37,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:06:37,791 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:37,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:06:37,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:06:37,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:06:37,792 INFO L87 Difference]: Start difference. First operand 140 states and 728 transitions. Second operand 12 states. [2019-01-20 10:06:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:38,657 INFO L93 Difference]: Finished difference Result 195 states and 830 transitions. [2019-01-20 10:06:38,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:38,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:06:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:38,659 INFO L225 Difference]: With dead ends: 195 [2019-01-20 10:06:38,660 INFO L226 Difference]: Without dead ends: 189 [2019-01-20 10:06:38,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:38,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-20 10:06:38,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 139. [2019-01-20 10:06:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-01-20 10:06:38,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 721 transitions. [2019-01-20 10:06:38,804 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 721 transitions. Word has length 7 [2019-01-20 10:06:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:38,805 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 721 transitions. [2019-01-20 10:06:38,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:06:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 721 transitions. [2019-01-20 10:06:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:38,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:38,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:38,805 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:38,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:38,806 INFO L82 PathProgramCache]: Analyzing trace with hash -2026977316, now seen corresponding path program 1 times [2019-01-20 10:06:38,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:38,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:38,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:38,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:38,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:38,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:38,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:38,978 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:38,978 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [27] [2019-01-20 10:06:38,980 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:38,980 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:38,982 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:38,982 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:06:38,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:38,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:38,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:38,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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:38,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:38,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:38,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:39,000 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-01-20 10:06:39,007 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-01-20 10:06:39,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:06:39,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,033 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:06:39,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 50 [2019-01-20 10:06:39,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:39,063 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:39,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:39,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:39,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:39,109 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-01-20 10:06:39,110 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-20 10:06:39,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,151 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-01-20 10:06:39,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:39,174 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-01-20 10:06:39,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:39,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,197 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:39,198 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-01-20 10:06:39,199 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:39,230 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-01-20 10:06:39,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-20 10:06:39,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:39,262 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-01-20 10:06:39,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:39,291 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-01-20 10:06:39,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:06:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:39,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:39,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:39,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:06:39,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:39,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:06:39,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:06:39,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:06:39,371 INFO L87 Difference]: Start difference. First operand 139 states and 721 transitions. Second operand 10 states. [2019-01-20 10:06:39,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:39,890 INFO L93 Difference]: Finished difference Result 157 states and 743 transitions. [2019-01-20 10:06:39,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:06:39,890 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:06:39,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:39,892 INFO L225 Difference]: With dead ends: 157 [2019-01-20 10:06:39,892 INFO L226 Difference]: Without dead ends: 156 [2019-01-20 10:06:39,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:06:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-20 10:06:40,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 137. [2019-01-20 10:06:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-01-20 10:06:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 718 transitions. [2019-01-20 10:06:40,005 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 718 transitions. Word has length 7 [2019-01-20 10:06:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:40,005 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 718 transitions. [2019-01-20 10:06:40,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:06:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 718 transitions. [2019-01-20 10:06:40,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:40,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:40,006 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:40,006 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:40,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash -2026986990, now seen corresponding path program 2 times [2019-01-20 10:06:40,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:40,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:40,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:40,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:40,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:40,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:40,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:40,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:40,172 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:40,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:40,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:40,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:40,187 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:40,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:40,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:06:40,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:40,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:40,201 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-01-20 10:06:40,214 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-01-20 10:06:40,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:06:40,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,234 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:06:40,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,252 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-01-20 10:06:40,253 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:40,273 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:40,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:40,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:40,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:40,321 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-01-20 10:06:40,321 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-20 10:06:40,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,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, 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-01-20 10:06:40,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:40,393 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-01-20 10:06:40,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:40,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,423 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:40,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, 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-01-20 10:06:40,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:40,455 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-01-20 10:06:40,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:30 [2019-01-20 10:06:40,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,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, 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-01-20 10:06:40,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:40,513 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-01-20 10:06:40,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-20 10:06:40,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:40,545 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:40,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, 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-01-20 10:06:40,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:40,578 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-01-20 10:06:40,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:06:40,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:40,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:40,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:40,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:40,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:06:40,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:40,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:06:40,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:06:40,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:06:40,671 INFO L87 Difference]: Start difference. First operand 137 states and 718 transitions. Second operand 12 states. [2019-01-20 10:06:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:41,309 INFO L93 Difference]: Finished difference Result 178 states and 767 transitions. [2019-01-20 10:06:41,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:41,310 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:06:41,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:41,312 INFO L225 Difference]: With dead ends: 178 [2019-01-20 10:06:41,312 INFO L226 Difference]: Without dead ends: 177 [2019-01-20 10:06:41,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:41,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-20 10:06:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 123. [2019-01-20 10:06:41,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-20 10:06:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 634 transitions. [2019-01-20 10:06:41,418 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 634 transitions. Word has length 7 [2019-01-20 10:06:41,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:41,418 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 634 transitions. [2019-01-20 10:06:41,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:06:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 634 transitions. [2019-01-20 10:06:41,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:41,419 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:41,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:41,419 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:41,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:41,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2027404064, now seen corresponding path program 2 times [2019-01-20 10:06:41,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:41,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:41,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:41,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:41,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:41,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:41,645 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:41,645 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:41,646 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:41,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:41,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:41,655 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:41,655 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:41,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:06:41,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:41,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:41,665 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-01-20 10:06:41,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,667 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-01-20 10:06:41,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,677 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-01-20 10:06:41,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,685 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-01-20 10:06:41,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,700 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-01-20 10:06:41,700 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:41,740 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:41,766 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:41,781 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:41,794 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:41,816 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-01-20 10:06:41,816 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:41,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,874 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-01-20 10:06:41,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:41,920 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-01-20 10:06:41,921 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:41,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:41,968 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:41,969 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-01-20 10:06:41,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:42,012 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-01-20 10:06:42,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-20 10:06:42,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,050 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 90 [2019-01-20 10:06:42,051 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:42,098 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-01-20 10:06:42,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-20 10:06:42,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:42,143 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:42,144 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 106 [2019-01-20 10:06:42,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:42,197 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-01-20 10:06:42,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:06:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:42,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:42,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:42,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:06:42,291 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:42,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:06:42,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:06:42,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:06:42,292 INFO L87 Difference]: Start difference. First operand 123 states and 634 transitions. Second operand 12 states. [2019-01-20 10:06:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:43,246 INFO L93 Difference]: Finished difference Result 204 states and 845 transitions. [2019-01-20 10:06:43,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-20 10:06:43,246 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:06:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:43,249 INFO L225 Difference]: With dead ends: 204 [2019-01-20 10:06:43,249 INFO L226 Difference]: Without dead ends: 203 [2019-01-20 10:06:43,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:06:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-20 10:06:43,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 126. [2019-01-20 10:06:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-20 10:06:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 654 transitions. [2019-01-20 10:06:43,355 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 654 transitions. Word has length 7 [2019-01-20 10:06:43,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:43,355 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 654 transitions. [2019-01-20 10:06:43,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:06:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 654 transitions. [2019-01-20 10:06:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:43,356 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:43,356 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:43,356 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:43,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:43,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2027156062, now seen corresponding path program 1 times [2019-01-20 10:06:43,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:43,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:43,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:43,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:43,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:43,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:43,904 WARN L181 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-20 10:06:44,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:44,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:44,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:44,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:44,070 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [27] [2019-01-20 10:06:44,071 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:44,071 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:44,074 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:44,074 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:06:44,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:44,074 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:44,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:44,075 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:44,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:44,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:44,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:44,089 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-01-20 10:06:44,092 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-01-20 10:06:44,096 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:06:44,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,193 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:06:44,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,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, 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-01-20 10:06:44,210 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:44,230 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:44,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:44,251 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:44,261 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:44,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-01-20 10:06:44,278 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:06:44,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,319 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-01-20 10:06:44,319 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:44,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-01-20 10:06:44,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:44,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,374 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:44,374 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-01-20 10:06:44,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:44,404 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-01-20 10:06:44,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:06:44,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:44,494 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 69 [2019-01-20 10:06:44,494 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:44,525 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-01-20 10:06:44,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:06:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:44,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:44,575 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:44,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:44,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:06:44,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:44,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:06:44,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:06:44,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:06:44,595 INFO L87 Difference]: Start difference. First operand 126 states and 654 transitions. Second operand 10 states. [2019-01-20 10:06:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:45,160 INFO L93 Difference]: Finished difference Result 178 states and 835 transitions. [2019-01-20 10:06:45,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:45,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:06:45,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:45,162 INFO L225 Difference]: With dead ends: 178 [2019-01-20 10:06:45,162 INFO L226 Difference]: Without dead ends: 177 [2019-01-20 10:06:45,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:06:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-01-20 10:06:45,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 108. [2019-01-20 10:06:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-20 10:06:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 546 transitions. [2019-01-20 10:06:45,261 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 546 transitions. Word has length 7 [2019-01-20 10:06:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:45,262 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 546 transitions. [2019-01-20 10:06:45,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:06:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 546 transitions. [2019-01-20 10:06:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:45,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:45,262 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:45,263 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:45,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:45,263 INFO L82 PathProgramCache]: Analyzing trace with hash -2023162082, now seen corresponding path program 1 times [2019-01-20 10:06:45,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:45,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:45,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:45,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:45,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:45,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:45,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:45,375 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:45,376 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [29] [2019-01-20 10:06:45,376 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:45,376 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:45,378 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:45,378 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:06:45,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:45,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:45,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:45,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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:45,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:45,392 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:45,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:45,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:45,399 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-01-20 10:06:45,403 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-01-20 10:06:45,412 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-01-20 10:06:45,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-20 10:06:45,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-20 10:06:45,435 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:45,449 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:45,459 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:45,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:45,479 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:45,492 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-01-20 10:06:45,493 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:25, output treesize:32 [2019-01-20 10:06:45,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,523 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-01-20 10:06:45,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:45,538 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-01-20 10:06:45,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:06:45,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:45,561 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-01-20 10:06:45,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:45,581 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-01-20 10:06:45,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-20 10:06:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:45,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:45,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:45,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:45,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:06:45,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:45,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:06:45,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:06:45,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:06:45,633 INFO L87 Difference]: Start difference. First operand 108 states and 546 transitions. Second operand 8 states. [2019-01-20 10:06:45,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:45,986 INFO L93 Difference]: Finished difference Result 134 states and 591 transitions. [2019-01-20 10:06:45,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:06:45,987 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:06:45,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:45,988 INFO L225 Difference]: With dead ends: 134 [2019-01-20 10:06:45,989 INFO L226 Difference]: Without dead ends: 133 [2019-01-20 10:06:45,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 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-01-20 10:06:45,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-01-20 10:06:46,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2019-01-20 10:06:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-20 10:06:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-20 10:06:46,092 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-20 10:06:46,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:46,092 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-20 10:06:46,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:06:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-20 10:06:46,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:46,093 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:46,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:46,093 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:46,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:46,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1962747920, now seen corresponding path program 1 times [2019-01-20 10:06:46,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:46,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:46,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:46,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:46,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:46,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:46,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:46,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:46,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:46,229 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:46,229 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [27] [2019-01-20 10:06:46,230 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:46,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:46,232 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:46,233 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:06:46,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:46,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:46,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:46,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:46,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:46,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:46,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:46,251 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-01-20 10:06:46,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,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, 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-01-20 10:06:46,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,264 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-01-20 10:06:46,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,272 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-01-20 10:06:46,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,286 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-01-20 10:06:46,286 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:46,313 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:46,327 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:46,339 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:46,348 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:46,366 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-01-20 10:06:46,367 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:46,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,399 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-01-20 10:06:46,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:46,439 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-01-20 10:06:46,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:46,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,477 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-01-20 10:06:46,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:46,522 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-01-20 10:06:46,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:46,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:46,557 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:46,558 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-01-20 10:06:46,559 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:46,606 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-01-20 10:06:46,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:46,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:46,628 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:46,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:46,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:46,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:06:46,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:46,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:06:46,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:06:46,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:06:46,686 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-20 10:06:47,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:47,350 INFO L93 Difference]: Finished difference Result 143 states and 604 transitions. [2019-01-20 10:06:47,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:06:47,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:06:47,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:47,352 INFO L225 Difference]: With dead ends: 143 [2019-01-20 10:06:47,352 INFO L226 Difference]: Without dead ends: 142 [2019-01-20 10:06:47,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:06:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-20 10:06:47,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2019-01-20 10:06:47,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-20 10:06:47,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 567 transitions. [2019-01-20 10:06:47,455 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 567 transitions. Word has length 7 [2019-01-20 10:06:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:47,455 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 567 transitions. [2019-01-20 10:06:47,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:06:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 567 transitions. [2019-01-20 10:06:47,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:47,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:47,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:47,456 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:47,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1962509592, now seen corresponding path program 1 times [2019-01-20 10:06:47,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:47,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:47,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:47,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:47,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:47,682 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 17 [2019-01-20 10:06:47,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:47,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:47,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:47,712 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:47,712 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [27] [2019-01-20 10:06:47,713 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:47,713 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:47,715 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:47,715 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:06:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:47,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:47,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:47,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:47,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:47,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:47,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:47,767 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-01-20 10:06:47,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, 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-01-20 10:06:47,892 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-01-20 10:06:48,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,030 INFO L303 Elim1Store]: Index analysis took 136 ms [2019-01-20 10:06:48,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-20 10:06:48,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-20 10:06:48,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:48,059 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:48,068 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:48,078 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:48,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:48,102 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-01-20 10:06:48,102 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-20 10:06:48,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,133 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-01-20 10:06:48,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:48,149 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-01-20 10:06:48,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:06:48,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,171 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-01-20 10:06:48,171 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:48,216 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-01-20 10:06:48,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:06:48,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:48,238 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:48,238 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-01-20 10:06:48,239 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:48,260 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-01-20 10:06:48,261 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-20 10:06:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:48,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:48,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:48,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:06:48,318 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:48,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:06:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:06:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:06:48,319 INFO L87 Difference]: Start difference. First operand 113 states and 567 transitions. Second operand 10 states. [2019-01-20 10:06:48,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:48,823 INFO L93 Difference]: Finished difference Result 151 states and 642 transitions. [2019-01-20 10:06:48,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:06:48,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:06:48,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:48,825 INFO L225 Difference]: With dead ends: 151 [2019-01-20 10:06:48,825 INFO L226 Difference]: Without dead ends: 150 [2019-01-20 10:06:48,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:06:48,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-01-20 10:06:48,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 121. [2019-01-20 10:06:48,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-20 10:06:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 615 transitions. [2019-01-20 10:06:48,933 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 615 transitions. Word has length 7 [2019-01-20 10:06:48,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:48,933 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 615 transitions. [2019-01-20 10:06:48,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:06:48,933 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 615 transitions. [2019-01-20 10:06:48,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:48,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:48,934 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:48,934 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:48,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:48,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1973605362, now seen corresponding path program 1 times [2019-01-20 10:06:48,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:48,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:48,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:48,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:48,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:49,148 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-20 10:06:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:49,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:49,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:49,229 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:49,229 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [25] [2019-01-20 10:06:49,230 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:49,230 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:49,232 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:49,232 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:06:49,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:49,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:49,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:49,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:49,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:49,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:49,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:49,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:49,254 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-01-20 10:06:49,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,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, 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-01-20 10:06:49,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,260 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-01-20 10:06:49,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,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, 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-01-20 10:06:49,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,391 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-01-20 10:06:49,391 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:49,419 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:49,434 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:49,446 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:49,456 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:49,474 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-01-20 10:06:49,475 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:49,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,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 72 [2019-01-20 10:06:49,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:49,547 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-01-20 10:06:49,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:49,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,582 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:49,582 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-01-20 10:06:49,583 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:49,626 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-01-20 10:06:49,627 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:49,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,666 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:49,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, 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-01-20 10:06:49,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:49,711 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-01-20 10:06:49,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:49,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:49,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 36 treesize of output 86 [2019-01-20 10:06:49,755 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:49,803 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-01-20 10:06:49,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:49,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-01-20 10:06:49,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:49,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:49,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:06:49,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:49,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:06:49,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:06:49,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:06:49,888 INFO L87 Difference]: Start difference. First operand 121 states and 615 transitions. Second operand 12 states. [2019-01-20 10:06:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:50,738 INFO L93 Difference]: Finished difference Result 215 states and 931 transitions. [2019-01-20 10:06:50,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:06:50,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:06:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:50,741 INFO L225 Difference]: With dead ends: 215 [2019-01-20 10:06:50,741 INFO L226 Difference]: Without dead ends: 214 [2019-01-20 10:06:50,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:50,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-20 10:06:50,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 142. [2019-01-20 10:06:50,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-01-20 10:06:50,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 741 transitions. [2019-01-20 10:06:50,875 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 741 transitions. Word has length 7 [2019-01-20 10:06:50,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:50,875 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 741 transitions. [2019-01-20 10:06:50,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:06:50,875 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 741 transitions. [2019-01-20 10:06:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:50,876 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:50,876 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:50,876 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:50,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:50,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1956607002, now seen corresponding path program 1 times [2019-01-20 10:06:50,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:50,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:50,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:50,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:50,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:50,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:50,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:50,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:50,904 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:50,905 INFO L207 CegarAbsIntRunner]: [0], [20], [24], [26], [28], [30], [31] [2019-01-20 10:06:50,905 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:50,905 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:50,907 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:50,908 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:06:50,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:50,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:50,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:50,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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:50,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:50,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:50,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:50,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:50,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-01-20 10:06:50,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, 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-01-20 10:06:50,947 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-01-20 10:06:50,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, 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-01-20 10:06:50,988 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-01-20 10:06:50,989 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:50,997 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:51,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:51,016 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:51,026 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:51,036 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-01-20 10:06:51,036 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:18, output treesize:26 [2019-01-20 10:06:51,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:51,122 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-01-20 10:06:51,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:51,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:51,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-20 10:06:51,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:51,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:51,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:06:51,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:06:51,163 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:06:51,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:06:51,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:06:51,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:06:51,163 INFO L87 Difference]: Start difference. First operand 142 states and 741 transitions. Second operand 4 states. [2019-01-20 10:06:51,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:51,517 INFO L93 Difference]: Finished difference Result 280 states and 1413 transitions. [2019-01-20 10:06:51,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:06:51,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-20 10:06:51,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:51,520 INFO L225 Difference]: With dead ends: 280 [2019-01-20 10:06:51,520 INFO L226 Difference]: Without dead ends: 275 [2019-01-20 10:06:51,520 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-01-20 10:06:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-01-20 10:06:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 252. [2019-01-20 10:06:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-01-20 10:06:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 1379 transitions. [2019-01-20 10:06:51,773 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 1379 transitions. Word has length 7 [2019-01-20 10:06:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:51,773 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 1379 transitions. [2019-01-20 10:06:51,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:06:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 1379 transitions. [2019-01-20 10:06:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:51,774 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:51,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:51,774 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:51,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1970145762, now seen corresponding path program 2 times [2019-01-20 10:06:51,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:51,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:51,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:51,775 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:06:51,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:51,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:51,975 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:51,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:51,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:51,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:51,986 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:51,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:51,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:06:51,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:51,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:51,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, 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-01-20 10:06:52,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,006 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-01-20 10:06:52,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,012 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-01-20 10:06:52,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,020 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-01-20 10:06:52,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,032 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-01-20 10:06:52,033 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:52,068 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:52,083 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:52,095 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:52,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:52,124 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-01-20 10:06:52,124 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:52,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,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, 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-01-20 10:06:52,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:52,205 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-01-20 10:06:52,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:52,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,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 36 treesize of output 86 [2019-01-20 10:06:52,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:52,293 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-01-20 10:06:52,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:52,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,332 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:52,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, 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-01-20 10:06:52,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:52,381 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-01-20 10:06:52,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:52,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:52,421 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:52,422 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-01-20 10:06:52,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:52,471 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-01-20 10:06:52,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:06:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:52,495 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:52,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:52,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:06:52,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:52,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:06:52,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:06:52,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:06:52,564 INFO L87 Difference]: Start difference. First operand 252 states and 1379 transitions. Second operand 11 states. [2019-01-20 10:06:53,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:53,563 INFO L93 Difference]: Finished difference Result 329 states and 1634 transitions. [2019-01-20 10:06:53,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:06:53,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-20 10:06:53,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:53,567 INFO L225 Difference]: With dead ends: 329 [2019-01-20 10:06:53,567 INFO L226 Difference]: Without dead ends: 328 [2019-01-20 10:06:53,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:06:53,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-20 10:06:53,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 271. [2019-01-20 10:06:53,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-20 10:06:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 1494 transitions. [2019-01-20 10:06:53,836 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 1494 transitions. Word has length 7 [2019-01-20 10:06:53,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:53,836 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 1494 transitions. [2019-01-20 10:06:53,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:06:53,836 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 1494 transitions. [2019-01-20 10:06:53,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:53,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:53,837 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:53,838 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:53,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:53,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1969597864, now seen corresponding path program 1 times [2019-01-20 10:06:53,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:53,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:53,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:53,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:53,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:53,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:53,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:53,965 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:53,965 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [29] [2019-01-20 10:06:53,966 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:53,966 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:53,967 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:53,967 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:06:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:53,968 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:53,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:53,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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:53,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:53,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:54,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:54,019 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-01-20 10:06:54,035 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-01-20 10:06:54,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:06:54,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,045 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:06:54,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,057 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-01-20 10:06:54,057 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:54,076 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:54,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:54,098 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:54,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:54,123 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-01-20 10:06:54,124 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:06:54,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,161 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-01-20 10:06:54,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:54,188 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-01-20 10:06:54,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:54,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:54,219 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-01-20 10:06:54,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:54,251 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-01-20 10:06:54,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:06:54,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:54,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:54,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:54,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:06:54,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:54,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:06:54,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:06:54,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:06:54,317 INFO L87 Difference]: Start difference. First operand 271 states and 1494 transitions. Second operand 8 states. [2019-01-20 10:06:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:54,916 INFO L93 Difference]: Finished difference Result 290 states and 1522 transitions. [2019-01-20 10:06:54,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:06:54,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:06:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:54,920 INFO L225 Difference]: With dead ends: 290 [2019-01-20 10:06:54,920 INFO L226 Difference]: Without dead ends: 286 [2019-01-20 10:06:54,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 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-01-20 10:06:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-01-20 10:06:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 273. [2019-01-20 10:06:55,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-01-20 10:06:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 1505 transitions. [2019-01-20 10:06:55,199 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 1505 transitions. Word has length 7 [2019-01-20 10:06:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:55,199 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 1505 transitions. [2019-01-20 10:06:55,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:06:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 1505 transitions. [2019-01-20 10:06:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:55,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:55,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:55,201 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:55,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1966084512, now seen corresponding path program 2 times [2019-01-20 10:06:55,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:55,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:55,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:55,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:55,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:55,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:55,306 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:55,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:55,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:55,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:55,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:55,315 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:06:55,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:06:55,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:06:55,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:55,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:55,326 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-01-20 10:06:55,329 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-01-20 10:06:55,337 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-01-20 10:06:55,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-20 10:06:55,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-20 10:06:55,367 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:55,382 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:55,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:55,402 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:55,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:55,425 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-01-20 10:06:55,426 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-20 10:06:55,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,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, 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-01-20 10:06:55,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:55,502 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-01-20 10:06:55,503 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:06:55,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,526 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:55,527 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 42 [2019-01-20 10:06:55,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:55,545 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-01-20 10:06:55,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:06:55,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:55,569 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-01-20 10:06:55,569 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:55,587 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-01-20 10:06:55,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:06:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:55,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:55,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:55,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:55,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:06:55,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:55,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:06:55,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:06:55,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:06:55,655 INFO L87 Difference]: Start difference. First operand 273 states and 1505 transitions. Second operand 10 states. [2019-01-20 10:06:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:56,270 INFO L93 Difference]: Finished difference Result 307 states and 1547 transitions. [2019-01-20 10:06:56,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:06:56,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:06:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:56,274 INFO L225 Difference]: With dead ends: 307 [2019-01-20 10:06:56,274 INFO L226 Difference]: Without dead ends: 302 [2019-01-20 10:06:56,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:06:56,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-01-20 10:06:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 247. [2019-01-20 10:06:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-01-20 10:06:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 1348 transitions. [2019-01-20 10:06:56,539 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 1348 transitions. Word has length 7 [2019-01-20 10:06:56,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:56,539 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 1348 transitions. [2019-01-20 10:06:56,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:06:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 1348 transitions. [2019-01-20 10:06:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:56,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:56,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:56,540 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:56,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:56,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1966448270, now seen corresponding path program 3 times [2019-01-20 10:06:56,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:56,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:56,541 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:56,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:56,542 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:56,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:56,771 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:56,772 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:06:56,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:06:56,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:56,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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:56,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:06:56,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:06:56,785 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:06:56,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:06:56,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:56,790 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-01-20 10:06:56,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,792 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-01-20 10:06:56,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,798 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-01-20 10:06:56,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,803 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-01-20 10:06:56,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,812 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-01-20 10:06:56,813 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:56,840 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:56,855 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:56,869 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:56,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:56,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:56,895 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:56,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:56,950 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-01-20 10:06:56,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:56,999 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-01-20 10:06:57,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:57,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,070 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:57,071 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-01-20 10:06:57,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:57,126 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-01-20 10:06:57,126 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:57,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,189 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:57,190 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-01-20 10:06:57,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:57,248 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-01-20 10:06:57,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:57,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,310 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-01-20 10:06:57,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:57,362 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-01-20 10:06:57,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:57,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,401 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:06:57,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:57,402 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-01-20 10:06:57,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:57,454 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-01-20 10:06:57,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:06:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:57,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:57,572 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:57,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:57,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-20 10:06:57,591 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:57,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:06:57,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:06:57,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:06:57,592 INFO L87 Difference]: Start difference. First operand 247 states and 1348 transitions. Second operand 14 states. [2019-01-20 10:06:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:06:58,896 INFO L93 Difference]: Finished difference Result 284 states and 1398 transitions. [2019-01-20 10:06:58,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:06:58,897 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-20 10:06:58,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:06:58,900 INFO L225 Difference]: With dead ends: 284 [2019-01-20 10:06:58,900 INFO L226 Difference]: Without dead ends: 279 [2019-01-20 10:06:58,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:06:58,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-20 10:06:59,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 195. [2019-01-20 10:06:59,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-01-20 10:06:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 1030 transitions. [2019-01-20 10:06:59,152 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 1030 transitions. Word has length 7 [2019-01-20 10:06:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:06:59,152 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 1030 transitions. [2019-01-20 10:06:59,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:06:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 1030 transitions. [2019-01-20 10:06:59,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:06:59,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:06:59,153 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:06:59,153 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:06:59,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:59,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1931949486, now seen corresponding path program 1 times [2019-01-20 10:06:59,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:06:59,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:59,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:06:59,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:06:59,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:06:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:59,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:59,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:59,218 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:06:59,218 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:06:59,218 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [26], [28], [29] [2019-01-20 10:06:59,219 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:06:59,219 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:06:59,221 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:06:59,221 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:06:59,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:06:59,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:06:59,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:06:59,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:06:59,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:06:59,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:06:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:06:59,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:06:59,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 18 treesize of output 21 [2019-01-20 10:06:59,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,246 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-01-20 10:06:59,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,253 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-01-20 10:06:59,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,266 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-01-20 10:06:59,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,276 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-01-20 10:06:59,277 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:59,304 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:59,319 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:59,329 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:59,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:06:59,358 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-01-20 10:06:59,358 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-20 10:06:59,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,390 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-01-20 10:06:59,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:59,434 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-01-20 10:06:59,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:59,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:06:59,473 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-01-20 10:06:59,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:06:59,518 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-01-20 10:06:59,518 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:06:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:59,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:06:59,548 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:06:59,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:06:59,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:06:59,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:06:59,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:06:59,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:06:59,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:06:59,567 INFO L87 Difference]: Start difference. First operand 195 states and 1030 transitions. Second operand 8 states. [2019-01-20 10:07:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:00,089 INFO L93 Difference]: Finished difference Result 230 states and 1135 transitions. [2019-01-20 10:07:00,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:07:00,090 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-20 10:07:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:00,092 INFO L225 Difference]: With dead ends: 230 [2019-01-20 10:07:00,092 INFO L226 Difference]: Without dead ends: 223 [2019-01-20 10:07:00,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 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-01-20 10:07:00,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-01-20 10:07:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 209. [2019-01-20 10:07:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-01-20 10:07:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 1112 transitions. [2019-01-20 10:07:00,366 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 1112 transitions. Word has length 7 [2019-01-20 10:07:00,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:00,367 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 1112 transitions. [2019-01-20 10:07:00,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:07:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 1112 transitions. [2019-01-20 10:07:00,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:07:00,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:00,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:00,367 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:00,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:00,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1931649590, now seen corresponding path program 1 times [2019-01-20 10:07:00,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:00,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:00,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:00,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:00,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:00,778 WARN L181 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-20 10:07:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:00,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:00,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:00,796 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:07:00,797 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [27] [2019-01-20 10:07:00,798 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:00,798 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:00,801 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:00,802 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:07:00,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:00,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:00,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:00,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:00,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:00,819 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:00,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:00,827 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-01-20 10:07:00,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,833 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-01-20 10:07:00,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,837 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-01-20 10:07:00,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,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, 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-01-20 10:07:00,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,850 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-01-20 10:07:00,850 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:00,879 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:00,894 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:00,906 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:00,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:00,935 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-01-20 10:07:00,935 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:00,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:00,969 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-01-20 10:07:00,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:01,011 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-01-20 10:07:01,012 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:01,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,046 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-01-20 10:07:01,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:01,095 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-01-20 10:07:01,096 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:01,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:01,131 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:01,132 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 104 [2019-01-20 10:07:01,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:01,196 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-01-20 10:07:01,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:01,215 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:01,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:01,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:01,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 10 [2019-01-20 10:07:01,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:01,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:07:01,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:07:01,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:07:01,254 INFO L87 Difference]: Start difference. First operand 209 states and 1112 transitions. Second operand 9 states. [2019-01-20 10:07:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:01,945 INFO L93 Difference]: Finished difference Result 254 states and 1212 transitions. [2019-01-20 10:07:01,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:07:01,945 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2019-01-20 10:07:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:01,948 INFO L225 Difference]: With dead ends: 254 [2019-01-20 10:07:01,948 INFO L226 Difference]: Without dead ends: 253 [2019-01-20 10:07:01,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:07:01,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-20 10:07:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 215. [2019-01-20 10:07:02,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-20 10:07:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1148 transitions. [2019-01-20 10:07:02,233 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1148 transitions. Word has length 7 [2019-01-20 10:07:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:02,233 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1148 transitions. [2019-01-20 10:07:02,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:07:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1148 transitions. [2019-01-20 10:07:02,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:07:02,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:02,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:02,234 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:02,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:02,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1933796528, now seen corresponding path program 1 times [2019-01-20 10:07:02,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:02,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:02,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:02,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:02,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:02,521 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-20 10:07:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:02,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:02,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:02,534 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:07:02,534 INFO L207 CegarAbsIntRunner]: [0], [6], [20], [24], [26], [28], [29] [2019-01-20 10:07:02,535 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:02,535 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:02,537 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:02,537 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:07:02,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:02,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:02,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:02,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:02,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:02,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:02,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:02,553 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-01-20 10:07:02,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,556 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-01-20 10:07:02,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,564 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-01-20 10:07:02,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,568 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-01-20 10:07:02,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07: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, 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-01-20 10:07:02,576 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:02,604 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:02,619 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:02,631 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:02,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:02,658 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-01-20 10:07:02,659 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:02,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,691 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-01-20 10:07:02,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:02,733 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-01-20 10:07:02,733 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:02,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:02,765 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:02,766 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-01-20 10:07:02,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:02,811 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-01-20 10:07:02,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:02,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:02,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:02,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:02,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:07:02,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:02,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:07:02,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:07:02,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:07:02,871 INFO L87 Difference]: Start difference. First operand 215 states and 1148 transitions. Second operand 7 states. [2019-01-20 10:07:03,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:03,351 INFO L93 Difference]: Finished difference Result 223 states and 1160 transitions. [2019-01-20 10:07:03,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:07:03,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-20 10:07:03,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:03,353 INFO L225 Difference]: With dead ends: 223 [2019-01-20 10:07:03,353 INFO L226 Difference]: Without dead ends: 216 [2019-01-20 10:07:03,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:07:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-01-20 10:07:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2019-01-20 10:07:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-01-20 10:07:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 1147 transitions. [2019-01-20 10:07:03,633 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 1147 transitions. Word has length 7 [2019-01-20 10:07:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:03,633 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 1147 transitions. [2019-01-20 10:07:03,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:07:03,633 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 1147 transitions. [2019-01-20 10:07:03,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:07:03,634 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:03,634 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:03,634 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:03,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:03,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1924430494, now seen corresponding path program 3 times [2019-01-20 10:07:03,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:03,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:03,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:03,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:03,635 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:03,800 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-20 10:07:03,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:03,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:03,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:03,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:03,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:03,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:03,910 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:03,918 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:07:03,919 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:07:03,923 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:07:03,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:03,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:03,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-01-20 10:07:03,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:03,931 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-01-20 10:07:03,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:03,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:03,935 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-01-20 10:07:03,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:03,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:03,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:03,943 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-01-20 10:07:03,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:03,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:03,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:03,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:03,951 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-01-20 10:07:03,952 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:03,977 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:03,992 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:04,004 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:04,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:04,031 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-01-20 10:07:04,032 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:04,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,068 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-01-20 10:07:04,068 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:04,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-01-20 10:07:04,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:04,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,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 36 treesize of output 86 [2019-01-20 10:07:04,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:04,197 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-01-20 10:07:04,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:04,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,241 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:04,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-01-20 10:07:04,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:04,293 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-01-20 10:07:04,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:04,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:04,338 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:04,339 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-01-20 10:07:04,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:04,387 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-01-20 10:07:04,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:04,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:04,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:04,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:07:04,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:04,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:07:04,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:07:04,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:07:04,499 INFO L87 Difference]: Start difference. First operand 215 states and 1147 transitions. Second operand 12 states. [2019-01-20 10:07:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:05,598 INFO L93 Difference]: Finished difference Result 285 states and 1372 transitions. [2019-01-20 10:07:05,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:07:05,599 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-20 10:07:05,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:05,602 INFO L225 Difference]: With dead ends: 285 [2019-01-20 10:07:05,602 INFO L226 Difference]: Without dead ends: 279 [2019-01-20 10:07:05,602 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:07:05,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-20 10:07:05,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 186. [2019-01-20 10:07:05,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-20 10:07:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 973 transitions. [2019-01-20 10:07:05,864 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 973 transitions. Word has length 7 [2019-01-20 10:07:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:05,865 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 973 transitions. [2019-01-20 10:07:05,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:07:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 973 transitions. [2019-01-20 10:07:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:07:05,865 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:05,865 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:05,865 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:05,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:05,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1928074670, now seen corresponding path program 2 times [2019-01-20 10:07:05,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:05,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:05,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:05,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:05,968 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:05,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:05,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:05,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:05,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:05,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:05,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:05,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:07:05,981 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:07:05,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:07:05,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:05,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:05,990 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-01-20 10:07:05,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:05,993 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-01-20 10:07:05,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,000 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-01-20 10:07:06,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,041 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-01-20 10:07:06,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,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, 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-01-20 10:07:06,049 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:06,078 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:06,093 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:06,104 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:06,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:06,132 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-01-20 10:07:06,132 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:06,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,328 INFO L303 Elim1Store]: Index analysis took 174 ms [2019-01-20 10:07:06,329 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-01-20 10:07:06,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:06,367 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-01-20 10:07:06,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:06,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,405 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:06,405 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-01-20 10:07:06,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:06,447 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-01-20 10:07:06,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:06,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:06,485 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-01-20 10:07:06,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:06,531 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-01-20 10:07:06,531 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:06,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:06,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:06,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:06,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:06,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:07:06,603 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:06,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:07:06,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:07:06,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:07:06,604 INFO L87 Difference]: Start difference. First operand 186 states and 973 transitions. Second operand 10 states. [2019-01-20 10:07:07,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:07,408 INFO L93 Difference]: Finished difference Result 252 states and 1178 transitions. [2019-01-20 10:07:07,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:07:07,408 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:07:07,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:07,412 INFO L225 Difference]: With dead ends: 252 [2019-01-20 10:07:07,412 INFO L226 Difference]: Without dead ends: 247 [2019-01-20 10:07:07,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:07:07,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-20 10:07:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 178. [2019-01-20 10:07:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-01-20 10:07:07,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 925 transitions. [2019-01-20 10:07:07,679 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 925 transitions. Word has length 7 [2019-01-20 10:07:07,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:07,679 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 925 transitions. [2019-01-20 10:07:07,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:07:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 925 transitions. [2019-01-20 10:07:07,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:07:07,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:07,679 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:07,680 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:07,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:07,680 INFO L82 PathProgramCache]: Analyzing trace with hash 2035383838, now seen corresponding path program 1 times [2019-01-20 10:07:07,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:07,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:07,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:07,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:07,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:07,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:07,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:07,830 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:07:07,830 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [29] [2019-01-20 10:07:07,830 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:07,830 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:07,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:07,832 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:07:07,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:07,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:07,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:07,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:07,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:07,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:07,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:07,847 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-01-20 10:07:07,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,851 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-01-20 10:07:07,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,859 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-01-20 10:07:07,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,867 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-01-20 10:07:07,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,877 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-01-20 10:07:07,877 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:07,905 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:07,921 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:07,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:07,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:07,960 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-01-20 10:07:07,960 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:07,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:07,996 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-01-20 10:07:07,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:08,037 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-01-20 10:07:08,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:08,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:08,069 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-01-20 10:07:08,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:08,114 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-01-20 10:07:08,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:08,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:08,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:08,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:08,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:08,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:07:08,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:08,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:07:08,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:07:08,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:07:08,173 INFO L87 Difference]: Start difference. First operand 178 states and 925 transitions. Second operand 7 states. [2019-01-20 10:07:08,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:08,651 INFO L93 Difference]: Finished difference Result 194 states and 950 transitions. [2019-01-20 10:07:08,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:07:08,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-20 10:07:08,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:08,654 INFO L225 Difference]: With dead ends: 194 [2019-01-20 10:07:08,654 INFO L226 Difference]: Without dead ends: 193 [2019-01-20 10:07:08,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:07:08,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-01-20 10:07:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 179. [2019-01-20 10:07:08,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-01-20 10:07:08,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 931 transitions. [2019-01-20 10:07:08,920 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 931 transitions. Word has length 7 [2019-01-20 10:07:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:08,921 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 931 transitions. [2019-01-20 10:07:08,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:07:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 931 transitions. [2019-01-20 10:07:08,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:07:08,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:08,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:08,921 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:08,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:08,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2134403662, now seen corresponding path program 2 times [2019-01-20 10:07:08,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:08,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:08,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:08,922 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:08,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:09,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:09,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:09,051 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:09,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:09,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:09,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:09,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:07:09,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:07:09,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:07:09,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:09,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:09,069 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-01-20 10:07:09,071 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-01-20 10:07:09,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:07:09,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,092 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:07:09,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,120 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-01-20 10:07:09,120 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:09,139 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:09,150 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:09,159 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:09,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:09,184 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-01-20 10:07:09,185 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:07:09,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,225 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-01-20 10:07:09,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:09,251 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-01-20 10:07:09,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:07:09,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,285 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-01-20 10:07:09,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:09,315 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-01-20 10:07:09,315 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:07:09,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,345 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:09,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:09,347 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-01-20 10:07:09,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:09,381 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-01-20 10:07:09,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:07:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:09,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:09,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:09,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:09,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:07:09,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:09,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:07:09,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:07:09,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:07:09,452 INFO L87 Difference]: Start difference. First operand 179 states and 931 transitions. Second operand 10 states. [2019-01-20 10:07:10,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:10,278 INFO L93 Difference]: Finished difference Result 265 states and 1253 transitions. [2019-01-20 10:07:10,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:07:10,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-20 10:07:10,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:10,281 INFO L225 Difference]: With dead ends: 265 [2019-01-20 10:07:10,281 INFO L226 Difference]: Without dead ends: 264 [2019-01-20 10:07:10,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:07:10,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-20 10:07:10,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 202. [2019-01-20 10:07:10,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-20 10:07:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1068 transitions. [2019-01-20 10:07:10,610 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1068 transitions. Word has length 7 [2019-01-20 10:07:10,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:10,610 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1068 transitions. [2019-01-20 10:07:10,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:07:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1068 transitions. [2019-01-20 10:07:10,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:07:10,611 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:10,611 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:10,611 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:10,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:10,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2132137560, now seen corresponding path program 1 times [2019-01-20 10:07:10,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:10,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:10,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:10,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:10,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:10,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:10,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:10,682 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:07:10,682 INFO L207 CegarAbsIntRunner]: [0], [14], [20], [24], [26], [28], [29] [2019-01-20 10:07:10,683 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:10,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:10,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:10,686 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:07:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:10,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:10,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:10,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:10,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:10,695 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:10,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:10,706 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-01-20 10:07:10,709 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-01-20 10:07:10,724 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-01-20 10:07:10,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:10,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-20 10:07:10,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:10,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:10,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-20 10:07:10,744 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:10,758 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:10,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:10,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:10,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:10,800 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-01-20 10:07:10,800 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-20 10:07:10,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:10,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:10,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:10,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:10,830 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-01-20 10:07:10,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:10,846 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-01-20 10:07:10,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:07:10,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:10,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:10,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:10,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:10,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:10,873 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:10,874 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 42 [2019-01-20 10:07:10,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:10,892 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-01-20 10:07:10,893 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:22 [2019-01-20 10:07:10,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:10,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:10,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:10,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:07:10,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:10,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:07:10,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:07:10,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:07:10,954 INFO L87 Difference]: Start difference. First operand 202 states and 1068 transitions. Second operand 7 states. [2019-01-20 10:07:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:11,429 INFO L93 Difference]: Finished difference Result 210 states and 1080 transitions. [2019-01-20 10:07:11,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:07:11,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-20 10:07:11,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:11,431 INFO L225 Difference]: With dead ends: 210 [2019-01-20 10:07:11,431 INFO L226 Difference]: Without dead ends: 203 [2019-01-20 10:07:11,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:07:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-01-20 10:07:11,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-01-20 10:07:11,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-20 10:07:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1066 transitions. [2019-01-20 10:07:11,766 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1066 transitions. Word has length 7 [2019-01-20 10:07:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:11,767 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1066 transitions. [2019-01-20 10:07:11,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:07:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1066 transitions. [2019-01-20 10:07:11,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-20 10:07:11,767 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:11,767 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:11,767 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:11,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:11,768 INFO L82 PathProgramCache]: Analyzing trace with hash -2141372770, now seen corresponding path program 1 times [2019-01-20 10:07:11,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:11,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:11,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:11,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:11,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:11,898 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-01-20 10:07:11,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:11,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:11,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:11,915 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-20 10:07:11,916 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [29] [2019-01-20 10:07:11,916 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:11,916 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:11,918 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:11,918 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 3. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:07:11,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:11,919 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:11,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:11,919 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:11,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:11,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:11,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:11,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-01-20 10:07:11,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, 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-01-20 10:07:11,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:11,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:07:11,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:11,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:11,950 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:07:11,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:11,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:11,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:11,962 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-01-20 10:07:11,963 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:11,982 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:11,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:12,003 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:12,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:12,030 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-01-20 10:07:12,030 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:07:12,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,070 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-01-20 10:07:12,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:12,097 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-01-20 10:07:12,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:07:12,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:12,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 31 treesize of output 65 [2019-01-20 10:07:12,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:12,157 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-01-20 10:07:12,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:07:12,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:12,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:12,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:12,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:07:12,493 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:12,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:07:12,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:07:12,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:07:12,493 INFO L87 Difference]: Start difference. First operand 202 states and 1066 transitions. Second operand 7 states. [2019-01-20 10:07:13,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:13,090 INFO L93 Difference]: Finished difference Result 216 states and 1089 transitions. [2019-01-20 10:07:13,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:07:13,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-20 10:07:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:13,092 INFO L225 Difference]: With dead ends: 216 [2019-01-20 10:07:13,092 INFO L226 Difference]: Without dead ends: 212 [2019-01-20 10:07:13,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:07:13,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-01-20 10:07:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 204. [2019-01-20 10:07:13,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-01-20 10:07:13,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 1077 transitions. [2019-01-20 10:07:13,428 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 1077 transitions. Word has length 7 [2019-01-20 10:07:13,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:13,428 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 1077 transitions. [2019-01-20 10:07:13,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:07:13,428 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 1077 transitions. [2019-01-20 10:07:13,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:13,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:13,429 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:13,429 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:13,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:13,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1804316618, now seen corresponding path program 2 times [2019-01-20 10:07:13,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:13,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:13,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:13,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:13,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:13,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:13,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:13,509 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:13,510 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:13,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:13,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:13,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:13,519 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:07:13,519 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:07:13,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:07:13,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:13,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:13,528 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-01-20 10:07:13,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,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, 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-01-20 10:07:13,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,541 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-01-20 10:07:13,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,551 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-01-20 10:07:13,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,558 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-01-20 10:07:13,558 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:13,586 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:13,601 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:13,613 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:13,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:13,641 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-01-20 10:07:13,642 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:13,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,674 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-01-20 10:07:13,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:13,713 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-01-20 10:07:13,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:13,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,893 INFO L303 Elim1Store]: Index analysis took 162 ms [2019-01-20 10:07:13,894 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-01-20 10:07:13,897 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:13,940 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-01-20 10:07:13,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-20 10:07:13,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:13,978 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-01-20 10:07:13,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:14,025 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-01-20 10:07:14,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:14,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-01-20 10:07:14,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:14,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:14,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:14,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:07:14,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:14,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:07:14,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:07:14,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:07:14,087 INFO L87 Difference]: Start difference. First operand 204 states and 1077 transitions. Second operand 10 states. [2019-01-20 10:07:15,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:15,108 INFO L93 Difference]: Finished difference Result 401 states and 2015 transitions. [2019-01-20 10:07:15,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:07:15,108 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-20 10:07:15,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:15,111 INFO L225 Difference]: With dead ends: 401 [2019-01-20 10:07:15,111 INFO L226 Difference]: Without dead ends: 397 [2019-01-20 10:07:15,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:07:15,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-20 10:07:15,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 342. [2019-01-20 10:07:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-20 10:07:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1889 transitions. [2019-01-20 10:07:15,718 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1889 transitions. Word has length 8 [2019-01-20 10:07:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:15,718 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1889 transitions. [2019-01-20 10:07:15,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:07:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1889 transitions. [2019-01-20 10:07:15,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:15,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:15,719 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:15,719 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1821001564, now seen corresponding path program 1 times [2019-01-20 10:07:15,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:15,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:15,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:15,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:15,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:15,776 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:07:15,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:07:15,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:07:15,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:07:15,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:07:15,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:07:15,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:07:15,777 INFO L87 Difference]: Start difference. First operand 342 states and 1889 transitions. Second operand 4 states. [2019-01-20 10:07:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:16,402 INFO L93 Difference]: Finished difference Result 347 states and 1893 transitions. [2019-01-20 10:07:16,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:07:16,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-01-20 10:07:16,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:16,405 INFO L225 Difference]: With dead ends: 347 [2019-01-20 10:07:16,405 INFO L226 Difference]: Without dead ends: 342 [2019-01-20 10:07:16,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01-20 10:07:16,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-01-20 10:07:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2019-01-20 10:07:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-01-20 10:07:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 1887 transitions. [2019-01-20 10:07:17,013 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 1887 transitions. Word has length 8 [2019-01-20 10:07:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:17,013 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 1887 transitions. [2019-01-20 10:07:17,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:07:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 1887 transitions. [2019-01-20 10:07:17,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:17,014 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:17,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:17,014 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:17,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1861261506, now seen corresponding path program 1 times [2019-01-20 10:07:17,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:17,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:17,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:17,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:17,015 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:17,205 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:17,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:17,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:17,206 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:07:17,206 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [25] [2019-01-20 10:07:17,206 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:17,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:17,208 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:17,208 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:07:17,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:17,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:17,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:17,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:17,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:17,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:17,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:17,229 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-01-20 10:07:17,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,238 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-01-20 10:07:17,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,244 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-01-20 10:07:17,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,251 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-01-20 10:07:17,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,262 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-01-20 10:07:17,263 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:17,384 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:17,399 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:17,411 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:17,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:17,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:17,449 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:17,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,503 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-01-20 10:07:17,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:17,553 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-01-20 10:07:17,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:17,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,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 38 treesize of output 80 [2019-01-20 10:07:17,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:17,661 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-01-20 10:07:17,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:17,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,703 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:17,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 94 [2019-01-20 10:07:17,704 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:17,760 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-01-20 10:07:17,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:17,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,803 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:17,804 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-01-20 10:07:17,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:17,856 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-01-20 10:07:17,856 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:17,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,892 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:17,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:17,894 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-01-20 10:07:17,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:17,942 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-01-20 10:07:17,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:07:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:17,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:18,030 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:18,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:18,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-20 10:07:18,049 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:18,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:07:18,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:07:18,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:07:18,050 INFO L87 Difference]: Start difference. First operand 342 states and 1887 transitions. Second operand 13 states. [2019-01-20 10:07:19,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:19,716 INFO L93 Difference]: Finished difference Result 471 states and 2470 transitions. [2019-01-20 10:07:19,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:07:19,716 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-20 10:07:19,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:19,719 INFO L225 Difference]: With dead ends: 471 [2019-01-20 10:07:19,719 INFO L226 Difference]: Without dead ends: 470 [2019-01-20 10:07:19,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=301, Unknown=0, NotChecked=0, Total=462 [2019-01-20 10:07:19,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-01-20 10:07:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 359. [2019-01-20 10:07:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-01-20 10:07:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1989 transitions. [2019-01-20 10:07:20,366 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 1989 transitions. Word has length 8 [2019-01-20 10:07:20,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:20,367 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 1989 transitions. [2019-01-20 10:07:20,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:07:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 1989 transitions. [2019-01-20 10:07:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:20,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:20,368 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:20,368 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:20,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:20,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1864721106, now seen corresponding path program 2 times [2019-01-20 10:07:20,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:20,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:20,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:20,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:20,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:20,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:20,603 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:20,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:20,603 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:20,603 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:20,611 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:07:20,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:07:20,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:07:20,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:20,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:20,622 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-01-20 10:07:20,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,626 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-01-20 10:07:20,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,629 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-01-20 10:07:20,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,636 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-01-20 10:07:20,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,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, 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-01-20 10:07:20,643 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:20,670 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:20,685 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:20,696 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:20,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:20,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:20,724 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:20,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,766 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-01-20 10:07:20,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:20,806 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-01-20 10:07:20,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:20,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,848 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-01-20 10:07:20,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:20,891 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-01-20 10:07:20,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:20,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,931 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:20,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:20,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, 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-01-20 10:07:20,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:20,981 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-01-20 10:07:20,981 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-20 10:07:21,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,023 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:21,024 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-01-20 10:07:21,025 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:21,081 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-01-20 10:07:21,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-20 10:07:21,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:21,128 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:21,128 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-01-20 10:07:21,129 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:21,175 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-01-20 10:07:21,175 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:07:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:21,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:21,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:21,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-20 10:07:21,303 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:21,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:07:21,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:07:21,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:07:21,303 INFO L87 Difference]: Start difference. First operand 359 states and 1989 transitions. Second operand 13 states. [2019-01-20 10:07:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:23,033 INFO L93 Difference]: Finished difference Result 483 states and 2465 transitions. [2019-01-20 10:07:23,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:07:23,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 8 [2019-01-20 10:07:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:23,036 INFO L225 Difference]: With dead ends: 483 [2019-01-20 10:07:23,037 INFO L226 Difference]: Without dead ends: 482 [2019-01-20 10:07:23,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:07:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-01-20 10:07:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 378. [2019-01-20 10:07:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-20 10:07:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2103 transitions. [2019-01-20 10:07:23,720 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2103 transitions. Word has length 8 [2019-01-20 10:07:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:23,720 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2103 transitions. [2019-01-20 10:07:23,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:07:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2103 transitions. [2019-01-20 10:07:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:23,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:23,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:23,721 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:23,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:23,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1868963088, now seen corresponding path program 1 times [2019-01-20 10:07:23,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:23,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:23,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:23,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:23,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:23,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:23,838 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:23,838 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:07:23,838 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [20], [24], [26], [28], [29] [2019-01-20 10:07:23,839 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:23,839 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:23,841 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:23,842 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:07:23,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:23,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:23,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:23,843 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:23,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:23,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:23,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:23,860 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-01-20 10:07:23,867 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-01-20 10:07:23,877 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-01-20 10:07:23,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:23,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-20 10:07:23,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:23,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:23,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, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-20 10:07:23,908 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:23,923 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:23,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:23,943 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:23,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:23,967 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-01-20 10:07:23,967 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-20 10:07:23,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:23,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:23,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,000 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-01-20 10:07:24,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:24,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:24,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:22 [2019-01-20 10:07:24,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,035 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 42 [2019-01-20 10:07:24,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:24,054 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-01-20 10:07:24,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:24 [2019-01-20 10:07:24,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:24,078 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:24,078 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-01-20 10:07:24,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:24,100 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-01-20 10:07:24,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-20 10:07:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:24,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:24,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:24,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:07:24,174 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:24,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:07:24,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:07:24,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:07:24,174 INFO L87 Difference]: Start difference. First operand 378 states and 2103 transitions. Second operand 10 states. [2019-01-20 10:07:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:25,139 INFO L93 Difference]: Finished difference Result 400 states and 2126 transitions. [2019-01-20 10:07:25,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:07:25,139 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-20 10:07:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:25,141 INFO L225 Difference]: With dead ends: 400 [2019-01-20 10:07:25,141 INFO L226 Difference]: Without dead ends: 393 [2019-01-20 10:07:25,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:07:25,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2019-01-20 10:07:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 380. [2019-01-20 10:07:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2019-01-20 10:07:25,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 2097 transitions. [2019-01-20 10:07:25,808 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 2097 transitions. Word has length 8 [2019-01-20 10:07:25,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:25,808 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 2097 transitions. [2019-01-20 10:07:25,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:07:25,808 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 2097 transitions. [2019-01-20 10:07:25,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:25,809 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:25,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:25,809 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:25,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:25,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1473696100, now seen corresponding path program 1 times [2019-01-20 10:07:25,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:25,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:25,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:25,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:25,810 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:25,933 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:25,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:25,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:25,933 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:07:25,933 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [20], [24], [26], [28], [29] [2019-01-20 10:07:25,934 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:25,934 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:25,935 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:25,935 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:07:25,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:25,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:25,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:25,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:25,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:25,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:25,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:25,953 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-01-20 10:07:25,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:25,963 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-01-20 10:07:25,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:25,970 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:25,970 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-01-20 10:07:25,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:25,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:25,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:25,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, 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-01-20 10:07:25,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:25,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:25,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:25,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:25,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, 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-01-20 10:07:25,995 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:26,022 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:26,037 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:26,049 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:26,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:26,077 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-01-20 10:07:26,078 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:26,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,113 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-01-20 10:07:26,113 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:26,159 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-01-20 10:07:26,160 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:26,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,193 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-01-20 10:07:26,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:26,240 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-01-20 10:07:26,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:26,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:26,281 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:26,282 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-01-20 10:07:26,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:26,330 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-01-20 10:07:26,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:26,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:26,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:26,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:26,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:26,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:07:26,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:26,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:07:26,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:07:26,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:07:26,416 INFO L87 Difference]: Start difference. First operand 380 states and 2097 transitions. Second operand 10 states. [2019-01-20 10:07:27,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:27,478 INFO L93 Difference]: Finished difference Result 409 states and 2136 transitions. [2019-01-20 10:07:27,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:07:27,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-20 10:07:27,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:27,480 INFO L225 Difference]: With dead ends: 409 [2019-01-20 10:07:27,480 INFO L226 Difference]: Without dead ends: 397 [2019-01-20 10:07:27,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:07:27,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-20 10:07:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 378. [2019-01-20 10:07:28,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-01-20 10:07:28,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 2077 transitions. [2019-01-20 10:07:28,161 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 2077 transitions. Word has length 8 [2019-01-20 10:07:28,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:28,162 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 2077 transitions. [2019-01-20 10:07:28,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:07:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 2077 transitions. [2019-01-20 10:07:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:28,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:28,162 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:28,163 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1464330066, now seen corresponding path program 3 times [2019-01-20 10:07:28,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:28,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:28,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:28,164 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:28,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:28,304 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 25 [2019-01-20 10:07:28,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:28,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:28,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:28,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:28,458 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:28,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:28,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:28,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:07:28,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:07:28,471 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:07:28,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:28,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:28,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:07:28,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,481 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-01-20 10:07:28,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,486 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-01-20 10:07:28,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,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, 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-01-20 10:07:28,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,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, 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-01-20 10:07:28,506 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:28,535 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:28,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:28,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:28,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:28,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:28,589 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:28,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,641 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-01-20 10:07:28,642 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:28,681 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-01-20 10:07:28,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:28,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,723 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-01-20 10:07:28,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:28,767 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-01-20 10:07:28,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:28,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,808 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:28,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,810 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-01-20 10:07:28,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:28,861 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-01-20 10:07:28,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:38 [2019-01-20 10:07:28,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,906 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:28,907 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-01-20 10:07:28,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:28,953 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-01-20 10:07:28,954 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-20 10:07:28,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:28,996 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:28,997 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-01-20 10:07:28,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:29,048 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-01-20 10:07:29,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:07:29,074 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:29,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:29,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:29,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-20 10:07:29,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:29,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:07:29,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:07:29,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:07:29,181 INFO L87 Difference]: Start difference. First operand 378 states and 2077 transitions. Second operand 14 states. [2019-01-20 10:07:31,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:31,092 INFO L93 Difference]: Finished difference Result 542 states and 2749 transitions. [2019-01-20 10:07:31,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:07:31,092 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-20 10:07:31,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:31,095 INFO L225 Difference]: With dead ends: 542 [2019-01-20 10:07:31,095 INFO L226 Difference]: Without dead ends: 536 [2019-01-20 10:07:31,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=374, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:07:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-20 10:07:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 446. [2019-01-20 10:07:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-01-20 10:07:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 2483 transitions. [2019-01-20 10:07:31,956 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 2483 transitions. Word has length 8 [2019-01-20 10:07:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:31,956 INFO L480 AbstractCegarLoop]: Abstraction has 446 states and 2483 transitions. [2019-01-20 10:07:31,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:07:31,956 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 2483 transitions. [2019-01-20 10:07:31,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:31,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:31,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:31,957 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:31,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:31,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1468154974, now seen corresponding path program 1 times [2019-01-20 10:07:31,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:31,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:31,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:31,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:31,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:31,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:32,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:32,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:32,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:32,063 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:07:32,063 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [26], [28], [29] [2019-01-20 10:07:32,064 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:32,064 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:32,066 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:32,066 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:07:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:32,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:32,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:32,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:32,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:32,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:32,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:32,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:32,095 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-01-20 10:07:32,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,099 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-01-20 10:07:32,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,105 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-01-20 10:07:32,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,121 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-01-20 10:07:32,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,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, 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-01-20 10:07:32,132 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:32,161 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:32,176 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:32,187 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:32,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:32,216 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-01-20 10:07:32,216 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:32,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,248 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-01-20 10:07:32,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:32,287 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-01-20 10:07:32,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:32,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,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, 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-01-20 10:07:32,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:32,372 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-01-20 10:07:32,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:32,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:32,411 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:32,411 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 104 [2019-01-20 10:07:32,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:32,460 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-01-20 10:07:32,460 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:32,485 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:32,514 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:32,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:32,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:07:32,532 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:32,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:07:32,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:07:32,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:07:32,533 INFO L87 Difference]: Start difference. First operand 446 states and 2483 transitions. Second operand 9 states. [2019-01-20 10:07:33,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:33,803 INFO L93 Difference]: Finished difference Result 469 states and 2511 transitions. [2019-01-20 10:07:33,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:07:33,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-20 10:07:33,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:33,805 INFO L225 Difference]: With dead ends: 469 [2019-01-20 10:07:33,805 INFO L226 Difference]: Without dead ends: 465 [2019-01-20 10:07:33,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:07:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2019-01-20 10:07:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 443. [2019-01-20 10:07:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-01-20 10:07:34,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 2463 transitions. [2019-01-20 10:07:34,732 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 2463 transitions. Word has length 8 [2019-01-20 10:07:34,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:34,733 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 2463 transitions. [2019-01-20 10:07:34,733 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:07:34,733 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 2463 transitions. [2019-01-20 10:07:34,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:34,734 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:34,734 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:34,734 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:34,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:34,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1587664806, now seen corresponding path program 4 times [2019-01-20 10:07:34,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:34,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:34,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:34,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:34,736 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:34,902 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-01-20 10:07:35,065 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:35,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:35,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:35,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:35,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:35,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:35,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:35,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:35,075 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:35,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:35,083 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-01-20 10:07:35,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,085 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-01-20 10:07:35,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,100 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-01-20 10:07:35,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,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, 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-01-20 10:07:35,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,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, 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-01-20 10:07:35,114 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:35,141 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:35,155 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:35,165 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:35,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:35,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:35,193 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:35,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,231 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-01-20 10:07:35,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:35,270 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-01-20 10:07:35,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:35,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,310 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:35,310 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-01-20 10:07:35,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:35,356 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-01-20 10:07:35,357 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:38 [2019-01-20 10:07:35,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,398 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-01-20 10:07:35,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:35,439 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-01-20 10:07:35,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-20 10:07:35,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,482 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:35,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, 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-01-20 10:07:35,483 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:35,529 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-01-20 10:07:35,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-20 10:07:35,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:35,576 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:35,576 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-01-20 10:07:35,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:35,623 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-01-20 10:07:35,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:07:35,650 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:35,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:35,750 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:35,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:35,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-20 10:07:35,769 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:35,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:07:35,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:07:35,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:07:35,769 INFO L87 Difference]: Start difference. First operand 443 states and 2463 transitions. Second operand 14 states. [2019-01-20 10:07:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:37,515 INFO L93 Difference]: Finished difference Result 481 states and 2515 transitions. [2019-01-20 10:07:37,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:07:37,515 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2019-01-20 10:07:37,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:37,518 INFO L225 Difference]: With dead ends: 481 [2019-01-20 10:07:37,518 INFO L226 Difference]: Without dead ends: 480 [2019-01-20 10:07:37,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:07:37,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2019-01-20 10:07:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2019-01-20 10:07:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-01-20 10:07:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 1362 transitions. [2019-01-20 10:07:38,017 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 1362 transitions. Word has length 8 [2019-01-20 10:07:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:38,017 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 1362 transitions. [2019-01-20 10:07:38,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:07:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 1362 transitions. [2019-01-20 10:07:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:38,018 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:38,018 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:38,018 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:38,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:38,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1706484960, now seen corresponding path program 1 times [2019-01-20 10:07:38,018 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:38,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:38,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:38,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:38,019 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:38,158 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:38,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:38,158 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:38,158 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:07:38,159 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [26], [28], [30], [31] [2019-01-20 10:07:38,159 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:38,159 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:38,161 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:38,162 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:07:38,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:38,162 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:38,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:38,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:38,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:38,174 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:38,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:38,184 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-01-20 10:07:38,187 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-01-20 10:07:38,203 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-01-20 10:07:38,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 31 [2019-01-20 10:07:38,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2019-01-20 10:07:38,241 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:38,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:38,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:38,278 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:38,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:38,301 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-01-20 10:07:38,301 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:25, output treesize:32 [2019-01-20 10:07:38,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,330 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-01-20 10:07:38,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:38,344 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-01-20 10:07:38,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:22 [2019-01-20 10:07:38,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:38,364 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-01-20 10:07:38,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:38,384 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-01-20 10:07:38,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:24 [2019-01-20 10:07:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:38,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:38,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:38,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:07:38,436 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:38,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:07:38,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:07:38,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:07:38,437 INFO L87 Difference]: Start difference. First operand 254 states and 1362 transitions. Second operand 8 states. [2019-01-20 10:07:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:39,122 INFO L93 Difference]: Finished difference Result 267 states and 1394 transitions. [2019-01-20 10:07:39,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:07:39,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-20 10:07:39,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:39,124 INFO L225 Difference]: With dead ends: 267 [2019-01-20 10:07:39,124 INFO L226 Difference]: Without dead ends: 258 [2019-01-20 10:07:39,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:07:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-20 10:07:39,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2019-01-20 10:07:39,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-01-20 10:07:39,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 1374 transitions. [2019-01-20 10:07:39,688 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 1374 transitions. Word has length 8 [2019-01-20 10:07:39,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:39,688 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 1374 transitions. [2019-01-20 10:07:39,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:07:39,689 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 1374 transitions. [2019-01-20 10:07:39,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:39,689 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:39,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:39,689 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:39,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:39,690 INFO L82 PathProgramCache]: Analyzing trace with hash -716062376, now seen corresponding path program 1 times [2019-01-20 10:07:39,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:39,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:39,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:39,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:39,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:39,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:39,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:39,873 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:39,873 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:07:39,873 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [27] [2019-01-20 10:07:39,874 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:39,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:39,876 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:39,876 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:07:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:39,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:39,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:39,877 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:39,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:39,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:39,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:39,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:39,893 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-01-20 10:07:39,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07: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, 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-01-20 10:07:39,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:39,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:39,903 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-01-20 10:07:39,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:39,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:39,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:39,918 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-01-20 10:07:39,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:39,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:39,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:39,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:39,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-01-20 10:07:39,930 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:39,957 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:39,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:39,981 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:39,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:40,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:40,009 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:40,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,042 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-01-20 10:07:40,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:40,085 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-01-20 10:07:40,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:40,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,124 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-01-20 10:07:40,125 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:40,167 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-01-20 10:07:40,167 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:40,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,208 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07: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, 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-01-20 10:07:40,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:40,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-01-20 10:07:40,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:40,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,294 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:40,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:40,296 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-01-20 10:07:40,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:40,343 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-01-20 10:07:40,343 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:07:40,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:40,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:40,445 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:40,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:40,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:07:40,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:40,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:07:40,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:07:40,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:07:40,464 INFO L87 Difference]: Start difference. First operand 257 states and 1374 transitions. Second operand 11 states. [2019-01-20 10:07:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:41,696 INFO L93 Difference]: Finished difference Result 309 states and 1505 transitions. [2019-01-20 10:07:41,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:07:41,696 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:07:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:41,698 INFO L225 Difference]: With dead ends: 309 [2019-01-20 10:07:41,698 INFO L226 Difference]: Without dead ends: 306 [2019-01-20 10:07:41,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:07:41,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-01-20 10:07:42,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 248. [2019-01-20 10:07:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-20 10:07:42,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1322 transitions. [2019-01-20 10:07:42,283 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1322 transitions. Word has length 8 [2019-01-20 10:07:42,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:42,283 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1322 transitions. [2019-01-20 10:07:42,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:07:42,283 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1322 transitions. [2019-01-20 10:07:42,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:42,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:42,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:42,284 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:42,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:42,284 INFO L82 PathProgramCache]: Analyzing trace with hash -698958370, now seen corresponding path program 1 times [2019-01-20 10:07:42,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:42,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:42,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:42,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:42,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:42,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:42,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:42,372 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:07:42,372 INFO L207 CegarAbsIntRunner]: [0], [18], [20], [24], [26], [28], [30], [31] [2019-01-20 10:07:42,372 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:42,373 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:42,375 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:42,375 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:07:42,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:42,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:42,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:42,376 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:42,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:42,390 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:42,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:42,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, 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-01-20 10:07:42,416 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-01-20 10:07:42,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, 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-01-20 10:07:42,442 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-01-20 10:07:42,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:42,455 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 30 [2019-01-20 10:07:42,456 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:42,467 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:42,477 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:42,486 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:42,496 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:42,508 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-01-20 10:07:42,508 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:22, output treesize:29 [2019-01-20 10:07:42,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:42,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:42,530 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 21 [2019-01-20 10:07:42,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:42,539 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:42,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:14 [2019-01-20 10:07:42,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:42,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:42,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:42,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:42,554 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 21 treesize of output 27 [2019-01-20 10:07:42,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:42,565 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-01-20 10:07:42,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:24, output treesize:14 [2019-01-20 10:07:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:42,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:42,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:42,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-20 10:07:42,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:42,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:07:42,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:07:42,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:07:42,611 INFO L87 Difference]: Start difference. First operand 248 states and 1322 transitions. Second operand 9 states. [2019-01-20 10:07:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:43,738 INFO L93 Difference]: Finished difference Result 379 states and 1929 transitions. [2019-01-20 10:07:43,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:07:43,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-20 10:07:43,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:43,740 INFO L225 Difference]: With dead ends: 379 [2019-01-20 10:07:43,740 INFO L226 Difference]: Without dead ends: 366 [2019-01-20 10:07:43,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=78, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:07:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-20 10:07:44,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 243. [2019-01-20 10:07:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-01-20 10:07:44,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 1245 transitions. [2019-01-20 10:07:44,463 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 1245 transitions. Word has length 8 [2019-01-20 10:07:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:44,463 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 1245 transitions. [2019-01-20 10:07:44,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:07:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 1245 transitions. [2019-01-20 10:07:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:44,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:44,464 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:44,464 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:44,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:44,464 INFO L82 PathProgramCache]: Analyzing trace with hash -712249128, now seen corresponding path program 1 times [2019-01-20 10:07:44,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:44,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:44,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:44,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:44,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:44,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:44,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:44,615 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:07:44,615 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [27] [2019-01-20 10:07:44,615 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:44,615 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:44,617 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:44,617 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:07:44,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:44,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:44,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:44,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:44,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:44,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:44,631 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:44,637 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-01-20 10:07:44,644 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-01-20 10:07:44,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:07:44,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:07:44,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,665 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-01-20 10:07:44,666 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:44,686 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:44,698 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:44,773 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:44,785 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:44,800 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-01-20 10:07:44,801 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-20 10:07:44,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,842 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-01-20 10:07:44,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:44,868 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-01-20 10:07:44,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:07:44,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,899 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-01-20 10:07:44,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:44,930 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-01-20 10:07:44,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:07:44,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,960 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:44,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:44,961 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-01-20 10:07:44,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:44,992 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-01-20 10:07:44,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:07:45,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:45,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:45,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:45,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:45,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:45,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:45,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:45,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:45,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:45,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:45,022 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:45,023 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-01-20 10:07:45,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:45,055 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-01-20 10:07:45,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:07:45,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:45,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:45,120 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:45,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:45,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-20 10:07:45,141 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:45,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:07:45,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:07:45,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:07:45,141 INFO L87 Difference]: Start difference. First operand 243 states and 1245 transitions. Second operand 12 states. [2019-01-20 10:07:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:46,847 INFO L93 Difference]: Finished difference Result 371 states and 1813 transitions. [2019-01-20 10:07:46,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:07:46,847 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-20 10:07:46,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:46,849 INFO L225 Difference]: With dead ends: 371 [2019-01-20 10:07:46,850 INFO L226 Difference]: Without dead ends: 366 [2019-01-20 10:07:46,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=242, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:07:46,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-20 10:07:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 248. [2019-01-20 10:07:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-01-20 10:07:47,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 1279 transitions. [2019-01-20 10:07:47,739 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 1279 transitions. Word has length 8 [2019-01-20 10:07:47,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:47,740 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 1279 transitions. [2019-01-20 10:07:47,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:07:47,740 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 1279 transitions. [2019-01-20 10:07:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:47,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:47,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:47,740 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1048410772, now seen corresponding path program 1 times [2019-01-20 10:07:47,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:47,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:47,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:47,741 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:47,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:47,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:47,867 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:07:47,867 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [27] [2019-01-20 10:07:47,868 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:47,868 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:47,869 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:47,869 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:07:47,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:47,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:47,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:47,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:47,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:47,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:47,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:47,888 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-01-20 10:07:47,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:47,893 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-01-20 10:07:47,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:47,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:47,899 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-01-20 10:07:47,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:47,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:47,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:47,907 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-01-20 10:07:47,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:47,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:47,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:47,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:47,915 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-01-20 10:07:47,915 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:47,943 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:47,959 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:47,970 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:47,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:47,999 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-01-20 10:07:48,000 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:48,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,035 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-01-20 10:07:48,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:48,079 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-01-20 10:07:48,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:48,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,117 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:48,118 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-01-20 10:07:48,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:48,182 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-01-20 10:07:48,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:48,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,257 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-01-20 10:07:48,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:48,323 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-01-20 10:07:48,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:48,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:48,411 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:48,411 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-01-20 10:07:48,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:48,472 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-01-20 10:07:48,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:07:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:48,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:48,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:48,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:07:48,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:48,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:07:48,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:07:48,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:07:48,608 INFO L87 Difference]: Start difference. First operand 248 states and 1279 transitions. Second operand 11 states. [2019-01-20 10:07:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:50,112 INFO L93 Difference]: Finished difference Result 285 states and 1427 transitions. [2019-01-20 10:07:50,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:07:50,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:07:50,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:50,114 INFO L225 Difference]: With dead ends: 285 [2019-01-20 10:07:50,114 INFO L226 Difference]: Without dead ends: 284 [2019-01-20 10:07:50,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:07:50,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-20 10:07:51,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 253. [2019-01-20 10:07:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-20 10:07:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 1305 transitions. [2019-01-20 10:07:51,018 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 1305 transitions. Word has length 8 [2019-01-20 10:07:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:51,019 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 1305 transitions. [2019-01-20 10:07:51,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:07:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 1305 transitions. [2019-01-20 10:07:51,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:51,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:51,019 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:51,020 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:51,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:51,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1055499044, now seen corresponding path program 1 times [2019-01-20 10:07:51,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:51,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:51,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:51,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:51,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:51,176 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-20 10:07:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:51,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:51,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:51,225 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:07:51,225 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [20], [24], [26], [28], [29] [2019-01-20 10:07:51,226 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:07:51,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:07:51,227 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:07:51,227 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:07:51,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:51,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:07:51,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:51,228 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:51,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:51,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:07:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:51,243 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:51,249 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-01-20 10:07:51,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,253 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-01-20 10:07:51,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,259 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-01-20 10:07:51,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,266 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-01-20 10:07:51,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,276 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-01-20 10:07:51,276 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:51,307 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:51,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:51,333 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:51,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:51,362 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-01-20 10:07:51,362 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:51,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,398 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-01-20 10:07:51,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:51,439 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-01-20 10:07:51,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:51,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,477 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:51,478 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-01-20 10:07:51,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:51,520 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-01-20 10:07:51,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:51,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:51,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, 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-01-20 10:07:51,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:51,605 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-01-20 10:07:51,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:51,689 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:51,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:51,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:51,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:07:51,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:51,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:07:51,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:07:51,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:07:51,741 INFO L87 Difference]: Start difference. First operand 253 states and 1305 transitions. Second operand 9 states. [2019-01-20 10:07:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:53,100 INFO L93 Difference]: Finished difference Result 281 states and 1396 transitions. [2019-01-20 10:07:53,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:07:53,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-20 10:07:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:53,102 INFO L225 Difference]: With dead ends: 281 [2019-01-20 10:07:53,102 INFO L226 Difference]: Without dead ends: 274 [2019-01-20 10:07:53,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:07:53,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-20 10:07:54,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 264. [2019-01-20 10:07:54,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2019-01-20 10:07:54,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 1366 transitions. [2019-01-20 10:07:54,081 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 1366 transitions. Word has length 8 [2019-01-20 10:07:54,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:54,081 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 1366 transitions. [2019-01-20 10:07:54,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:07:54,081 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 1366 transitions. [2019-01-20 10:07:54,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:54,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:54,082 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:54,082 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:54,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:54,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1051985692, now seen corresponding path program 2 times [2019-01-20 10:07:54,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:54,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:54,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:07:54,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:54,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:07:54,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:54,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:54,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:54,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:54,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:54,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:54,277 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:07:54,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:07:54,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:07:54,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:54,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:54,286 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-01-20 10:07:54,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,292 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-01-20 10:07:54,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,297 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-01-20 10:07:54,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,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, 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-01-20 10:07:54,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,313 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-01-20 10:07:54,314 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:54,341 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:54,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:54,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:54,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:54,394 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-01-20 10:07:54,394 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:07:54,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,429 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-01-20 10:07:54,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:54,470 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-01-20 10:07:54,470 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:54,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,508 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:54,509 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-01-20 10:07:54,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:54,552 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-01-20 10:07:54,553 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:54,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,592 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:54,593 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-01-20 10:07:54,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:54,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-01-20 10:07:54,635 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:54,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:54,676 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-01-20 10:07:54,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:54,721 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-01-20 10:07:54,721 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:07:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:54,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:54,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:54,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:07:54,827 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:54,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:07:54,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:07:54,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:07:54,828 INFO L87 Difference]: Start difference. First operand 264 states and 1366 transitions. Second operand 12 states. [2019-01-20 10:07:56,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:07:56,497 INFO L93 Difference]: Finished difference Result 295 states and 1460 transitions. [2019-01-20 10:07:56,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:07:56,498 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-20 10:07:56,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:07:56,499 INFO L225 Difference]: With dead ends: 295 [2019-01-20 10:07:56,499 INFO L226 Difference]: Without dead ends: 288 [2019-01-20 10:07:56,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:07:56,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-01-20 10:07:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 263. [2019-01-20 10:07:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-20 10:07:57,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1359 transitions. [2019-01-20 10:07:57,496 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1359 transitions. Word has length 8 [2019-01-20 10:07:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:07:57,496 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1359 transitions. [2019-01-20 10:07:57,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:07:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1359 transitions. [2019-01-20 10:07:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:07:57,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:07:57,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:07:57,497 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:07:57,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:07:57,497 INFO L82 PathProgramCache]: Analyzing trace with hash -937469088, now seen corresponding path program 2 times [2019-01-20 10:07:57,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:07:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:57,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:07:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:07:57,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:07:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:07:57,650 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-20 10:07:57,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:57,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:57,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:07:57,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:07:57,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:07:57,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:07:57,728 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:07:57,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:07:57,738 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:07:57,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:07:57,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:07:57,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:07:57,748 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-01-20 10:07:57,752 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-01-20 10:07:57,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:07:57,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:07:57,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,779 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-01-20 10:07:57,779 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:57,798 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:57,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:57,819 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:57,828 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:07:57,844 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-01-20 10:07:57,844 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-20 10:07:57,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,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, 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-01-20 10:07:57,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:57,911 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-01-20 10:07:57,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:07:57,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:57,944 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-01-20 10:07:57,944 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:57,975 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-01-20 10:07:57,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:07:57,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,009 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:58,009 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-01-20 10:07:58,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:58,041 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-01-20 10:07:58,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:07:58,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:07:58,074 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:07:58,075 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-01-20 10:07:58,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:07:58,104 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-01-20 10:07:58,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:07:58,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:58,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:07:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:07:58,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:07:58,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:07:58,196 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:07:58,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:07:58,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:07:58,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:07:58,197 INFO L87 Difference]: Start difference. First operand 263 states and 1359 transitions. Second operand 12 states. [2019-01-20 10:08:00,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:00,159 INFO L93 Difference]: Finished difference Result 370 states and 1786 transitions. [2019-01-20 10:08:00,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:08:00,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-20 10:08:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:00,161 INFO L225 Difference]: With dead ends: 370 [2019-01-20 10:08:00,161 INFO L226 Difference]: Without dead ends: 363 [2019-01-20 10:08:00,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:08:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-01-20 10:08:01,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 288. [2019-01-20 10:08:01,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-01-20 10:08:01,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 1503 transitions. [2019-01-20 10:08:01,283 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 1503 transitions. Word has length 8 [2019-01-20 10:08:01,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:01,283 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 1503 transitions. [2019-01-20 10:08:01,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:08:01,283 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 1503 transitions. [2019-01-20 10:08:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:08:01,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:01,284 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:01,284 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash -819496728, now seen corresponding path program 3 times [2019-01-20 10:08:01,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:01,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:01,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:01,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:01,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:01,439 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2019-01-20 10:08:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:01,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:01,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:01,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:01,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:01,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:01,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:01,542 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:08:01,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:08:01,547 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:08:01,547 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:01,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:01,549 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-01-20 10:08:01,552 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-01-20 10:08:01,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:08:01,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,564 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:08:01,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,573 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-01-20 10:08:01,573 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:01,592 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:01,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:01,613 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:01,622 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:01,638 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-01-20 10:08:01,638 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-20 10:08:01,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,681 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-01-20 10:08:01,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:01,709 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-01-20 10:08:01,709 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:08:01,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,741 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:01,742 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-01-20 10:08:01,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:01,769 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-01-20 10:08:01,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:08:01,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,801 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-01-20 10:08:01,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:01,831 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-01-20 10:08:01,831 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:08:01,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,862 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:01,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:01,864 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-01-20 10:08:01,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:01,896 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-01-20 10:08:01,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:08:01,920 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:01,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:01,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:01,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:08:01,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:01,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:08:01,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:08:01,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:08:01,996 INFO L87 Difference]: Start difference. First operand 288 states and 1503 transitions. Second operand 12 states. [2019-01-20 10:08:03,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:03,793 INFO L93 Difference]: Finished difference Result 349 states and 1691 transitions. [2019-01-20 10:08:03,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:08:03,793 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-20 10:08:03,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:03,794 INFO L225 Difference]: With dead ends: 349 [2019-01-20 10:08:03,794 INFO L226 Difference]: Without dead ends: 344 [2019-01-20 10:08:03,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:08:03,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-20 10:08:04,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 236. [2019-01-20 10:08:04,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-20 10:08:04,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1210 transitions. [2019-01-20 10:08:04,786 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1210 transitions. Word has length 8 [2019-01-20 10:08:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:04,786 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1210 transitions. [2019-01-20 10:08:04,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:08:04,786 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1210 transitions. [2019-01-20 10:08:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:08:04,786 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:04,786 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:04,787 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:04,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:04,787 INFO L82 PathProgramCache]: Analyzing trace with hash -826465836, now seen corresponding path program 1 times [2019-01-20 10:08:04,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:04,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:04,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:04,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:04,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:08:04,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:04,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:04,913 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:08:04,913 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [20], [24], [26], [28], [29] [2019-01-20 10:08:04,914 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:04,914 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:04,915 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:04,915 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:08:04,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:04,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:04,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:04,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:04,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:04,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:04,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:04,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 18 treesize of output 21 [2019-01-20 10:08:05,005 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-01-20 10:08:05,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,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, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:08:05,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,042 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:08:05,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,054 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-01-20 10:08:05,055 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:05,075 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:05,087 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:05,096 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:05,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:05,121 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-01-20 10:08:05,122 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-20 10:08:05,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,164 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-01-20 10:08:05,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:05,190 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-01-20 10:08:05,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:08:05,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,218 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:05,219 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-01-20 10:08:05,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:05,246 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-01-20 10:08:05,247 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:08:05,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:05,278 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-01-20 10:08:05,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:05,310 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-01-20 10:08:05,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:30 [2019-01-20 10:08:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:05,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:05,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:05,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:08:05,382 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:05,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:08:05,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:08:05,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:08:05,382 INFO L87 Difference]: Start difference. First operand 236 states and 1210 transitions. Second operand 9 states. [2019-01-20 10:08:06,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:06,789 INFO L93 Difference]: Finished difference Result 257 states and 1260 transitions. [2019-01-20 10:08:06,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:08:06,789 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-20 10:08:06,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:06,790 INFO L225 Difference]: With dead ends: 257 [2019-01-20 10:08:06,790 INFO L226 Difference]: Without dead ends: 250 [2019-01-20 10:08:06,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:08:06,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-01-20 10:08:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 238. [2019-01-20 10:08:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-01-20 10:08:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 1220 transitions. [2019-01-20 10:08:07,810 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 1220 transitions. Word has length 8 [2019-01-20 10:08:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:07,811 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 1220 transitions. [2019-01-20 10:08:07,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:08:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 1220 transitions. [2019-01-20 10:08:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:08:07,811 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:07,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:07,811 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:07,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash -252398774, now seen corresponding path program 1 times [2019-01-20 10:08:07,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:07,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:07,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:07,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:07,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:07,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:08:07,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:07,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:07,943 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:08:07,943 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [27] [2019-01-20 10:08:07,943 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:07,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:07,944 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:07,945 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:08:07,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:07,945 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:07,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:07,945 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 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:07,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:07,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:07,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:07,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 18 treesize of output 21 [2019-01-20 10:08:07,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:07,986 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-01-20 10:08:07,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:07,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:07,997 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-01-20 10:08:08,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,004 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-01-20 10:08:08,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,011 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-01-20 10:08:08,011 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:08,039 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:08,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:08,065 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:08,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:08,094 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-01-20 10:08:08,094 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:08:08,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,132 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-01-20 10:08:08,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:08,173 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-01-20 10:08:08,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:08,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,217 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-01-20 10:08:08,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:08,263 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-01-20 10:08:08,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:08,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,300 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:08,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,302 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-01-20 10:08:08,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:08,352 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-01-20 10:08:08,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:08:08,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:08,395 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:08,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, 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 106 [2019-01-20 10:08:08,396 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:08,448 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-01-20 10:08:08,448 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:08:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:08,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:08,520 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:08,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:08,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:08:08,538 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:08,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:08:08,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:08:08,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:08:08,539 INFO L87 Difference]: Start difference. First operand 238 states and 1220 transitions. Second operand 11 states. [2019-01-20 10:08:10,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:10,513 INFO L93 Difference]: Finished difference Result 316 states and 1514 transitions. [2019-01-20 10:08:10,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:08:10,514 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-20 10:08:10,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:10,515 INFO L225 Difference]: With dead ends: 316 [2019-01-20 10:08:10,515 INFO L226 Difference]: Without dead ends: 315 [2019-01-20 10:08:10,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:08:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-01-20 10:08:11,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 242. [2019-01-20 10:08:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-01-20 10:08:11,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 1244 transitions. [2019-01-20 10:08:11,585 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 1244 transitions. Word has length 8 [2019-01-20 10:08:11,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:11,585 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 1244 transitions. [2019-01-20 10:08:11,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:08:11,585 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 1244 transitions. [2019-01-20 10:08:11,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:08:11,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:11,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:11,586 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:11,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:11,586 INFO L82 PathProgramCache]: Analyzing trace with hash -191146492, now seen corresponding path program 1 times [2019-01-20 10:08:11,586 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:11,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:11,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:11,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:11,587 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:11,781 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-20 10:08:11,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:08:11,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:11,830 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:11,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:08:11,831 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [20], [24], [26], [28], [29] [2019-01-20 10:08:11,832 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:11,832 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:11,834 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:11,834 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:08:11,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:11,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:11,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:11,836 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 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:11,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:11,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:11,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:11,897 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-01-20 10:08:11,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:11,937 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-01-20 10:08:11,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:11,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:11,953 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-01-20 10:08:11,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:11,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:11,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:11,958 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-01-20 10:08:11,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:11,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:11,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:11,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:11,965 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-01-20 10:08:11,965 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:11,992 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:12,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:12,017 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:12,027 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:12,046 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-01-20 10:08:12,046 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:08:12,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,279 INFO L303 Elim1Store]: Index analysis took 212 ms [2019-01-20 10:08:12,279 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-01-20 10:08:12,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:12,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-01-20 10:08:12,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:12,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,358 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:12,359 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-01-20 10:08:12,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:12,403 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-01-20 10:08:12,403 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:12,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:12,441 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:12,442 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-01-20 10:08:12,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:12,486 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-01-20 10:08:12,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:12,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:12,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:12,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:08:12,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:12,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:08:12,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:08:12,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:08:12,587 INFO L87 Difference]: Start difference. First operand 242 states and 1244 transitions. Second operand 9 states. [2019-01-20 10:08:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:14,028 INFO L93 Difference]: Finished difference Result 253 states and 1273 transitions. [2019-01-20 10:08:14,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:08:14,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-20 10:08:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:14,029 INFO L225 Difference]: With dead ends: 253 [2019-01-20 10:08:14,029 INFO L226 Difference]: Without dead ends: 246 [2019-01-20 10:08:14,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:08:14,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-01-20 10:08:15,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2019-01-20 10:08:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-01-20 10:08:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 1234 transitions. [2019-01-20 10:08:15,082 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 1234 transitions. Word has length 8 [2019-01-20 10:08:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:15,083 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 1234 transitions. [2019-01-20 10:08:15,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:08:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 1234 transitions. [2019-01-20 10:08:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:08:15,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:15,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:15,083 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:15,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:15,084 INFO L82 PathProgramCache]: Analyzing trace with hash -477618734, now seen corresponding path program 2 times [2019-01-20 10:08:15,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:15,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:15,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:15,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:15,084 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:15,303 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:08:15,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:15,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:15,304 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:15,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:15,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:15,304 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 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:15,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:08:15,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:08:15,321 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:08:15,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:15,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:15,324 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-01-20 10:08:15,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,328 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-01-20 10:08:15,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,335 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-01-20 10:08:15,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,341 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-01-20 10:08:15,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,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, 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-01-20 10:08:15,348 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:15,375 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:15,388 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:15,399 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:15,408 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:15,426 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-01-20 10:08:15,427 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:08:15,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,464 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-01-20 10:08:15,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:15,506 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-01-20 10:08:15,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:15,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,546 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-01-20 10:08:15,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:15,593 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-01-20 10:08:15,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:15,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,634 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:15,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 38 treesize of output 98 [2019-01-20 10:08:15,635 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:15,681 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-01-20 10:08:15,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:08:15,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:15,725 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:15,726 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 99 [2019-01-20 10:08:15,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:15,775 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-01-20 10:08:15,775 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:08:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:15,803 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:15,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:15,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:15,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:08:15,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:15,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:08:15,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:08:15,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:08:15,891 INFO L87 Difference]: Start difference. First operand 240 states and 1234 transitions. Second operand 12 states. [2019-01-20 10:08:18,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:18,000 INFO L93 Difference]: Finished difference Result 332 states and 1585 transitions. [2019-01-20 10:08:18,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:08:18,001 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 8 [2019-01-20 10:08:18,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:18,002 INFO L225 Difference]: With dead ends: 332 [2019-01-20 10:08:18,003 INFO L226 Difference]: Without dead ends: 328 [2019-01-20 10:08:18,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:08:18,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-01-20 10:08:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 220. [2019-01-20 10:08:19,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-01-20 10:08:19,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 1124 transitions. [2019-01-20 10:08:19,022 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 1124 transitions. Word has length 8 [2019-01-20 10:08:19,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:19,022 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 1124 transitions. [2019-01-20 10:08:19,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:08:19,022 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 1124 transitions. [2019-01-20 10:08:19,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:08:19,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:19,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:19,023 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:19,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:19,023 INFO L82 PathProgramCache]: Analyzing trace with hash -366615482, now seen corresponding path program 1 times [2019-01-20 10:08:19,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:19,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:19,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:08:19,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:19,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:19,537 WARN L181 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 21 [2019-01-20 10:08:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:08:19,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:19,580 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:19,580 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:08:19,580 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [29] [2019-01-20 10:08:19,581 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:19,581 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:19,583 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:19,583 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:08:19,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:19,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:19,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:19,584 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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:19,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:19,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:19,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:19,602 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-01-20 10:08:19,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,607 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-01-20 10:08:19,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,615 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-01-20 10:08:19,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,623 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-01-20 10:08:19,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,631 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-01-20 10:08:19,631 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:19,659 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:19,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:19,686 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:19,696 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:19,715 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-01-20 10:08:19,715 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:08:19,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,751 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-01-20 10:08:19,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:19,793 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-01-20 10:08:19,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:19,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,830 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:19,831 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-01-20 10:08:19,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:19,876 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-01-20 10:08:19,877 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:19,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:19,912 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-01-20 10:08:19,913 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:19,967 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-01-20 10:08:19,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:19,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:20,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:20,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:20,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:08:20,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:20,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:08:20,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:08:20,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:08:20,048 INFO L87 Difference]: Start difference. First operand 220 states and 1124 transitions. Second operand 9 states. [2019-01-20 10:08:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:21,487 INFO L93 Difference]: Finished difference Result 242 states and 1184 transitions. [2019-01-20 10:08:21,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:08:21,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2019-01-20 10:08:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:21,488 INFO L225 Difference]: With dead ends: 242 [2019-01-20 10:08:21,488 INFO L226 Difference]: Without dead ends: 241 [2019-01-20 10:08:21,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:08:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-20 10:08:22,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-20 10:08:22,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-20 10:08:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1154 transitions. [2019-01-20 10:08:22,577 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1154 transitions. Word has length 8 [2019-01-20 10:08:22,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:22,577 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1154 transitions. [2019-01-20 10:08:22,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:08:22,577 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1154 transitions. [2019-01-20 10:08:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:08:22,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:22,578 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:22,578 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash -987816240, now seen corresponding path program 1 times [2019-01-20 10:08:22,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:22,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:22,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:22,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:22,579 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:08:22,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:22,692 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:22,692 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:08:22,692 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [29] [2019-01-20 10:08:22,692 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:22,692 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:22,694 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:22,694 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:08:22,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:22,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:22,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:22,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:22,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:22,705 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:22,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:22,712 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-01-20 10:08:22,736 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-01-20 10:08:22,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:08:22,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,748 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:08:22,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,757 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-01-20 10:08:22,758 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:22,778 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:22,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:22,798 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:22,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:22,824 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-01-20 10:08:22,824 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:08:22,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,864 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-01-20 10:08:22,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:22,890 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-01-20 10:08:22,891 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:08:22,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:22,919 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:22,920 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-01-20 10:08:22,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:22,947 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-01-20 10:08:22,948 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:08:23,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:23,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:23,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:23,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:23,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:23,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:23,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:23,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:23,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:23,075 INFO L303 Elim1Store]: Index analysis took 108 ms [2019-01-20 10:08:23,075 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-01-20 10:08:23,076 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:23,103 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-01-20 10:08:23,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:08:23,125 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:23,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:23,181 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:23,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:23,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:08:23,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:23,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:08:23,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:08:23,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:08:23,201 INFO L87 Difference]: Start difference. First operand 225 states and 1154 transitions. Second operand 10 states. [2019-01-20 10:08:24,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:24,720 INFO L93 Difference]: Finished difference Result 254 states and 1190 transitions. [2019-01-20 10:08:24,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:08:24,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-20 10:08:24,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:24,721 INFO L225 Difference]: With dead ends: 254 [2019-01-20 10:08:24,722 INFO L226 Difference]: Without dead ends: 245 [2019-01-20 10:08:24,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:08:24,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-01-20 10:08:25,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 226. [2019-01-20 10:08:25,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-20 10:08:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1153 transitions. [2019-01-20 10:08:25,804 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1153 transitions. Word has length 8 [2019-01-20 10:08:25,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:25,805 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1153 transitions. [2019-01-20 10:08:25,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:08:25,805 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1153 transitions. [2019-01-20 10:08:25,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:08:25,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:25,805 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:25,805 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:25,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:25,806 INFO L82 PathProgramCache]: Analyzing trace with hash -993357366, now seen corresponding path program 1 times [2019-01-20 10:08:25,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:25,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:25,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:25,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:25,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:25,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:25,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:25,927 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:25,927 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:08:25,927 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [29] [2019-01-20 10:08:25,927 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:25,928 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:25,929 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:25,929 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:08:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:25,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:25,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:25,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 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:25,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:25,941 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:25,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:25,949 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-01-20 10:08:25,951 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-01-20 10:08:25,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:25,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:08:25,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:25,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:25,967 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:08:25,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:25,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:25,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:25,977 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-01-20 10:08:25,977 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:25,998 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:26,009 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:26,019 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:26,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:26,046 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-01-20 10:08:26,046 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:08:26,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,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, 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-01-20 10:08:26,087 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:26,113 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-01-20 10:08:26,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:08:26,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,143 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:26,144 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-01-20 10:08:26,144 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:26,174 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-01-20 10:08:26,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:08:26,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:26,207 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 69 [2019-01-20 10:08:26,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:26,239 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-01-20 10:08:26,240 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:08:26,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:26,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:26,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:26,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:08:26,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:26,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:08:26,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:08:26,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:08:26,315 INFO L87 Difference]: Start difference. First operand 226 states and 1153 transitions. Second operand 10 states. [2019-01-20 10:08:27,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:27,796 INFO L93 Difference]: Finished difference Result 249 states and 1194 transitions. [2019-01-20 10:08:27,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:08:27,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 8 [2019-01-20 10:08:27,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:27,798 INFO L225 Difference]: With dead ends: 249 [2019-01-20 10:08:27,798 INFO L226 Difference]: Without dead ends: 248 [2019-01-20 10:08:27,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:08:27,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-01-20 10:08:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 229. [2019-01-20 10:08:28,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-20 10:08:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1171 transitions. [2019-01-20 10:08:28,908 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1171 transitions. Word has length 8 [2019-01-20 10:08:28,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:28,908 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1171 transitions. [2019-01-20 10:08:28,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:08:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1171 transitions. [2019-01-20 10:08:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:08:28,909 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:28,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:28,909 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:28,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:28,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1327610400, now seen corresponding path program 1 times [2019-01-20 10:08:28,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:28,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:28,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:28,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:28,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:29,411 WARN L181 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 17 [2019-01-20 10:08:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:08:29,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:29,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:29,537 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:08:29,537 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [26], [28], [30], [31] [2019-01-20 10:08:29,538 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:29,538 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:29,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:29,540 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:08:29,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:29,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:29,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:29,541 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 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:29,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:29,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:29,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:29,556 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-01-20 10:08:29,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,562 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-01-20 10:08:29,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,567 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-01-20 10:08:29,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,572 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-01-20 10:08:29,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,580 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-01-20 10:08:29,581 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:29,608 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:29,623 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:29,634 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:29,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:29,663 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-01-20 10:08:29,663 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:31, output treesize:38 [2019-01-20 10:08:29,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,695 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-01-20 10:08:29,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:29,740 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-01-20 10:08:29,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:29,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:29,771 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-01-20 10:08:29,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:29,818 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-01-20 10:08:29,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:08:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:29,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:29,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:29,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:08:29,961 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:29,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:08:29,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:08:29,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:08:29,962 INFO L87 Difference]: Start difference. First operand 229 states and 1171 transitions. Second operand 7 states. [2019-01-20 10:08:31,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:31,305 INFO L93 Difference]: Finished difference Result 239 states and 1185 transitions. [2019-01-20 10:08:31,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:08:31,306 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-20 10:08:31,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:31,307 INFO L225 Difference]: With dead ends: 239 [2019-01-20 10:08:31,307 INFO L226 Difference]: Without dead ends: 230 [2019-01-20 10:08:31,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:08:31,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-01-20 10:08:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-01-20 10:08:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-20 10:08:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1158 transitions. [2019-01-20 10:08:32,396 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1158 transitions. Word has length 8 [2019-01-20 10:08:32,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:32,397 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1158 transitions. [2019-01-20 10:08:32,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:08:32,397 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1158 transitions. [2019-01-20 10:08:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-20 10:08:32,397 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:32,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:32,397 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:32,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:32,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1098577192, now seen corresponding path program 1 times [2019-01-20 10:08:32,398 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:32,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:32,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:32,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:32,398 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:32,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:08:32,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:32,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:32,472 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 9 with the following transitions: [2019-01-20 10:08:32,472 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [26], [28], [30], [31] [2019-01-20 10:08:32,473 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:32,473 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:32,474 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:32,475 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:08:32,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:32,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:32,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:32,475 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 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:32,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:32,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:32,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 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 18 treesize of output 21 [2019-01-20 10:08:32,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, 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-01-20 10:08:32,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:08:32,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,518 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:08:32,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,529 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-01-20 10:08:32,529 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:32,550 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:32,561 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:32,571 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:32,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:32,598 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-01-20 10:08:32,598 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:08:32,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,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, 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-01-20 10:08:32,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:32,665 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-01-20 10:08:32,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:08:32,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:32,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 33 treesize of output 67 [2019-01-20 10:08:32,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:32,722 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-01-20 10:08:32,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:08:32,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:32,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:32,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:32,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-20 10:08:32,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:32,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:08:32,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:08:32,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:08:32,778 INFO L87 Difference]: Start difference. First operand 227 states and 1158 transitions. Second operand 7 states. [2019-01-20 10:08:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:33,995 INFO L93 Difference]: Finished difference Result 236 states and 1166 transitions. [2019-01-20 10:08:33,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:08:33,996 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 8 [2019-01-20 10:08:33,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:33,997 INFO L225 Difference]: With dead ends: 236 [2019-01-20 10:08:33,997 INFO L226 Difference]: Without dead ends: 227 [2019-01-20 10:08:33,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:08:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-20 10:08:35,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-01-20 10:08:35,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-20 10:08:35,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 1149 transitions. [2019-01-20 10:08:35,104 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 1149 transitions. Word has length 8 [2019-01-20 10:08:35,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:35,105 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 1149 transitions. [2019-01-20 10:08:35,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:08:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 1149 transitions. [2019-01-20 10:08:35,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:08:35,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:35,105 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:35,105 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:35,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:35,106 INFO L82 PathProgramCache]: Analyzing trace with hash 213756976, now seen corresponding path program 1 times [2019-01-20 10:08:35,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:35,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:35,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:35,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:35,106 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:35,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:08:35,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:35,199 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:35,199 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:08:35,199 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [26], [28], [30], [31] [2019-01-20 10:08:35,199 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:35,200 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:35,201 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:35,201 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:08:35,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:35,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:35,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:35,202 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 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:35,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:35,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:35,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:35,228 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-01-20 10:08:35,230 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-01-20 10:08:35,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,238 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:08:35,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,245 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:08:35,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,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, 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-01-20 10:08:35,255 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:35,274 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:35,286 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:35,298 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:35,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:35,324 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-01-20 10:08:35,325 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:08:35,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,362 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-01-20 10:08:35,362 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:35,388 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-01-20 10:08:35,388 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:08:35,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,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, 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 57 [2019-01-20 10:08:35,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:35,447 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-01-20 10:08:35,447 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-20 10:08:35,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:35,476 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-01-20 10:08:35,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:35,507 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-01-20 10:08:35,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:32 [2019-01-20 10:08:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:35,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:35,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:35,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:08:35,579 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:35,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:08:35,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:08:35,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:08:35,580 INFO L87 Difference]: Start difference. First operand 226 states and 1149 transitions. Second operand 9 states. [2019-01-20 10:08:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:36,857 INFO L93 Difference]: Finished difference Result 236 states and 1163 transitions. [2019-01-20 10:08:36,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:08:36,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-20 10:08:36,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:36,858 INFO L225 Difference]: With dead ends: 236 [2019-01-20 10:08:36,858 INFO L226 Difference]: Without dead ends: 227 [2019-01-20 10:08:36,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:08:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-01-20 10:08:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-01-20 10:08:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-01-20 10:08:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 1137 transitions. [2019-01-20 10:08:37,938 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 1137 transitions. Word has length 9 [2019-01-20 10:08:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:37,938 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 1137 transitions. [2019-01-20 10:08:37,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:08:37,938 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 1137 transitions. [2019-01-20 10:08:37,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:08:37,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:37,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:37,939 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:37,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:37,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1864950956, now seen corresponding path program 1 times [2019-01-20 10:08:37,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:37,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:37,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:38,100 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 16 [2019-01-20 10:08:38,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:08:38,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:38,209 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:38,209 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:08:38,210 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [20], [24], [26], [28], [29] [2019-01-20 10:08:38,210 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:38,210 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:38,211 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:38,211 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:08:38,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:38,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:38,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:38,212 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 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:38,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:38,220 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:38,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:38,229 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-01-20 10:08:38,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,231 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-01-20 10:08:38,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,236 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-01-20 10:08:38,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,301 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-01-20 10:08:38,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,397 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-01-20 10:08:38,398 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:38,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:38,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:38,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:38,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:38,549 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-01-20 10:08:38,550 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:08:38,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,585 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-01-20 10:08:38,586 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:38,628 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-01-20 10:08:38,629 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:38,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,666 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-01-20 10:08:38,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:38,712 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-01-20 10:08:38,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:08:38,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,752 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:38,753 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-01-20 10:08:38,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:38,805 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-01-20 10:08:38,806 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:08:38,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:38,850 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:38,851 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-01-20 10:08:38,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:38,899 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-01-20 10:08:38,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:08:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:38,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:38,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:38,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:08:38,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:38,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:08:38,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:08:38,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:08:38,999 INFO L87 Difference]: Start difference. First operand 224 states and 1137 transitions. Second operand 11 states. [2019-01-20 10:08:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:41,138 INFO L93 Difference]: Finished difference Result 326 states and 1545 transitions. [2019-01-20 10:08:41,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:08:41,139 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-20 10:08:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:41,140 INFO L225 Difference]: With dead ends: 326 [2019-01-20 10:08:41,141 INFO L226 Difference]: Without dead ends: 316 [2019-01-20 10:08:41,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:08:41,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-01-20 10:08:42,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 197. [2019-01-20 10:08:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-20 10:08:42,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 997 transitions. [2019-01-20 10:08:42,297 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 997 transitions. Word has length 9 [2019-01-20 10:08:42,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:42,297 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 997 transitions. [2019-01-20 10:08:42,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:08:42,297 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 997 transitions. [2019-01-20 10:08:42,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:08:42,298 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:42,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:42,298 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:42,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:42,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1989953630, now seen corresponding path program 1 times [2019-01-20 10:08:42,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:42,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:42,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:42,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:42,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:08:42,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:42,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:42,417 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:08:42,417 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [20], [24], [26], [28], [30], [31] [2019-01-20 10:08:42,417 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:42,417 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:42,419 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:42,419 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:08:42,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:42,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:42,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:42,420 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 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:42,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:42,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:42,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:42,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:42,438 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-01-20 10:08:42,442 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-01-20 10:08:42,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:08:42,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,464 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:08:42,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,490 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-01-20 10:08:42,491 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:42,511 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:42,523 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:42,533 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:42,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:42,559 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-01-20 10:08:42,559 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:08:42,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,596 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-01-20 10:08:42,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:42,624 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-01-20 10:08:42,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:08:42,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,648 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:42,648 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-01-20 10:08:42,649 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:42,680 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-01-20 10:08:42,681 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:08:42,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:42,711 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-01-20 10:08:42,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:42,740 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-01-20 10:08:42,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:08:42,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:42,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:42,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:42,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:08:42,803 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:42,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:08:42,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:08:42,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:08:42,804 INFO L87 Difference]: Start difference. First operand 197 states and 997 transitions. Second operand 10 states. [2019-01-20 10:08:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:44,694 INFO L93 Difference]: Finished difference Result 288 states and 1415 transitions. [2019-01-20 10:08:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:08:44,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2019-01-20 10:08:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:44,696 INFO L225 Difference]: With dead ends: 288 [2019-01-20 10:08:44,696 INFO L226 Difference]: Without dead ends: 279 [2019-01-20 10:08:44,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:08:44,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-20 10:08:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 263. [2019-01-20 10:08:46,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-01-20 10:08:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 1349 transitions. [2019-01-20 10:08:46,286 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 1349 transitions. Word has length 9 [2019-01-20 10:08:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:46,287 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 1349 transitions. [2019-01-20 10:08:46,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:08:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 1349 transitions. [2019-01-20 10:08:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:08:46,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:46,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:46,288 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:46,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:46,288 INFO L82 PathProgramCache]: Analyzing trace with hash 958709548, now seen corresponding path program 1 times [2019-01-20 10:08:46,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:46,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:46,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:46,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:46,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:08:46,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:46,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:46,415 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:08:46,415 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [26], [28], [30], [31] [2019-01-20 10:08:46,416 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:46,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:46,417 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:46,417 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:08:46,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:46,417 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:46,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:46,417 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:46,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:46,425 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:46,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:46,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 18 treesize of output 21 [2019-01-20 10:08:46,441 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-01-20 10:08:46,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:08:46,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,462 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:08:46,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,474 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-01-20 10:08:46,475 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:46,494 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:46,506 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:46,516 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:46,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:46,542 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-01-20 10:08:46,542 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-20 10:08:46,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,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, 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-01-20 10:08:46,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:46,610 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-01-20 10:08:46,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:08:46,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,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 67 [2019-01-20 10:08:46,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:46,670 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-01-20 10:08:46,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:08:46,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,697 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:46,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:46,698 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-01-20 10:08:46,699 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:46,739 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-01-20 10:08:46,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:08:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:46,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:46,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:46,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:08:46,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:46,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:08:46,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:08:46,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:08:46,816 INFO L87 Difference]: Start difference. First operand 263 states and 1349 transitions. Second operand 9 states. [2019-01-20 10:08:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:48,767 INFO L93 Difference]: Finished difference Result 277 states and 1384 transitions. [2019-01-20 10:08:48,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:08:48,767 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-20 10:08:48,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:48,768 INFO L225 Difference]: With dead ends: 277 [2019-01-20 10:08:48,768 INFO L226 Difference]: Without dead ends: 268 [2019-01-20 10:08:48,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:08:48,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-01-20 10:08:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-01-20 10:08:50,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-20 10:08:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 1361 transitions. [2019-01-20 10:08:50,416 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 1361 transitions. Word has length 9 [2019-01-20 10:08:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:50,417 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 1361 transitions. [2019-01-20 10:08:50,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:08:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 1361 transitions. [2019-01-20 10:08:50,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:08:50,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:50,417 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:50,418 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:50,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:50,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1855010516, now seen corresponding path program 1 times [2019-01-20 10:08:50,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:50,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:50,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:50,419 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:08:50,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:50,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:50,616 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:08:50,617 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [27] [2019-01-20 10:08:50,617 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:08:50,617 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:08:50,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:08:50,619 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:08:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:50,619 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:08:50,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:50,619 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 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:50,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:50,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:08:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:50,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:50,640 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-01-20 10:08:50,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,643 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-01-20 10:08:50,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,652 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-01-20 10:08:50,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,658 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-01-20 10:08:50,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,666 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-01-20 10:08:50,667 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:50,693 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:50,707 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:50,719 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:50,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:50,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:50,746 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:08:50,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,782 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-01-20 10:08:50,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:50,824 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-01-20 10:08:50,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:50,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,864 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:50,865 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-01-20 10:08:50,866 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:50,913 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-01-20 10:08:50,914 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:50,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:50,957 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-01-20 10:08:50,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:51,002 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-01-20 10:08:51,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:51,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,043 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:51,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,045 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-01-20 10:08:51,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:51,094 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-01-20 10:08:51,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:08:51,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:51,140 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:51,140 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-01-20 10:08:51,141 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:51,190 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-01-20 10:08:51,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:08:51,212 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:51,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:51,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:51,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-20 10:08:51,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:51,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:08:51,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:08:51,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:08:51,307 INFO L87 Difference]: Start difference. First operand 266 states and 1361 transitions. Second operand 13 states. [2019-01-20 10:08:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:08:54,243 INFO L93 Difference]: Finished difference Result 361 states and 1740 transitions. [2019-01-20 10:08:54,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:08:54,243 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-20 10:08:54,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:08:54,245 INFO L225 Difference]: With dead ends: 361 [2019-01-20 10:08:54,245 INFO L226 Difference]: Without dead ends: 356 [2019-01-20 10:08:54,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:08:54,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-01-20 10:08:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 282. [2019-01-20 10:08:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-20 10:08:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 1454 transitions. [2019-01-20 10:08:55,980 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 1454 transitions. Word has length 9 [2019-01-20 10:08:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:08:55,980 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 1454 transitions. [2019-01-20 10:08:55,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:08:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 1454 transitions. [2019-01-20 10:08:55,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:08:55,981 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:08:55,981 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:08:55,981 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:08:55,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:08:55,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1858585436, now seen corresponding path program 2 times [2019-01-20 10:08:55,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:08:55,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:55,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:08:55,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:08:55,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:08:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:08:56,203 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 25 [2019-01-20 10:08:56,327 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-20 10:08:56,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:56,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:08:56,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:08:56,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:08:56,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:08:56,328 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 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:08:56,339 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:08:56,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:08:56,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:08:56,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:08:56,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:08:56,352 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-01-20 10:08:56,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,356 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-01-20 10:08:56,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,360 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-01-20 10:08:56,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,367 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-01-20 10:08:56,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,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, 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-01-20 10:08:56,375 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:56,404 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:56,419 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:56,431 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:56,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:56,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:08:56,459 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:08:56,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:56,497 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-01-20 10:08:56,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:57,010 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-01-20 10:08:57,011 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:57,319 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-20 10:08:57,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:57,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:57,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:57,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:57,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:57,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:57,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:57,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:57,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:57,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:57,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:57,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:57,610 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:57,610 INFO L303 Elim1Store]: Index analysis took 288 ms [2019-01-20 10:08:57,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, 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-01-20 10:08:57,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:58,079 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-01-20 10:08:58,080 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:58,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,126 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-01-20 10:08:58,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:58,170 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-01-20 10:08:58,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:08:58,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,213 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:58,213 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-01-20 10:08:58,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:58,263 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-01-20 10:08:58,264 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:08:58,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,302 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:08:58,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:08:58,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 38 treesize of output 93 [2019-01-20 10:08:58,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:08:58,355 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-01-20 10:08:58,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:08:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:58,380 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:08:58,457 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:08:58,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:08:58,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-20 10:08:58,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:08:58,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:08:58,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:08:58,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:08:58,478 INFO L87 Difference]: Start difference. First operand 282 states and 1454 transitions. Second operand 13 states. [2019-01-20 10:09:01,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:01,318 INFO L93 Difference]: Finished difference Result 357 states and 1714 transitions. [2019-01-20 10:09:01,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:09:01,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-01-20 10:09:01,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:01,320 INFO L225 Difference]: With dead ends: 357 [2019-01-20 10:09:01,320 INFO L226 Difference]: Without dead ends: 352 [2019-01-20 10:09:01,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:09:01,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-01-20 10:09:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 236. [2019-01-20 10:09:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-20 10:09:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 1192 transitions. [2019-01-20 10:09:02,859 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 1192 transitions. Word has length 9 [2019-01-20 10:09:02,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:02,859 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 1192 transitions. [2019-01-20 10:09:02,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:09:02,859 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 1192 transitions. [2019-01-20 10:09:02,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:09:02,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:02,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:02,860 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:02,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:02,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1629790556, now seen corresponding path program 3 times [2019-01-20 10:09:02,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:02,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:02,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:02,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:02,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:02,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:03,098 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:09:03,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:03,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:03,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:03,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:03,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:03,100 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 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:03,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:09:03,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:09:03,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:09:03,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:03,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:03,149 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-01-20 10:09:03,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,154 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-01-20 10:09:03,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,160 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-01-20 10:09:03,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,168 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-01-20 10:09:03,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,178 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-01-20 10:09:03,178 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:03,213 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:03,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:03,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:03,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:03,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:03,269 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:09:03,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,306 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-01-20 10:09:03,306 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:03,347 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-01-20 10:09:03,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:03,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,384 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:03,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, 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-01-20 10:09:03,385 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:03,427 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-01-20 10:09:03,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:03,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,470 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-01-20 10:09:03,471 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:03,519 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-01-20 10:09:03,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:03,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,567 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:03,567 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-01-20 10:09:03,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:03,613 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-01-20 10:09:03,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:09:03,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:03,659 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:03,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 99 [2019-01-20 10:09:03,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:03,712 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-01-20 10:09:03,713 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:09:03,738 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:03,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:03,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:03,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:03,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-20 10:09:03,843 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:03,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:09:03,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:09:03,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:09:03,843 INFO L87 Difference]: Start difference. First operand 236 states and 1192 transitions. Second operand 14 states. [2019-01-20 10:09:06,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:06,104 INFO L93 Difference]: Finished difference Result 260 states and 1232 transitions. [2019-01-20 10:09:06,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:09:06,104 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 9 [2019-01-20 10:09:06,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:06,106 INFO L225 Difference]: With dead ends: 260 [2019-01-20 10:09:06,106 INFO L226 Difference]: Without dead ends: 253 [2019-01-20 10:09:06,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2019-01-20 10:09:06,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-01-20 10:09:07,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 152. [2019-01-20 10:09:07,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-01-20 10:09:07,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 750 transitions. [2019-01-20 10:09:07,148 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 750 transitions. Word has length 9 [2019-01-20 10:09:07,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:07,148 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 750 transitions. [2019-01-20 10:09:07,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:09:07,148 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 750 transitions. [2019-01-20 10:09:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:09:07,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:07,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:07,149 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:07,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:07,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1114051924, now seen corresponding path program 1 times [2019-01-20 10:09:07,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:07,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:07,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:07,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:07,149 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:07,322 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 21 [2019-01-20 10:09:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:07,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:07,409 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:07,410 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:09:07,410 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-20 10:09:07,411 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:07,411 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:07,412 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:07,412 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:09:07,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:07,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:07,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:07,413 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 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:07,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:07,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:07,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:07,437 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-01-20 10:09:07,440 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-01-20 10:09:07,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:09:07,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:09:07,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,462 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-01-20 10:09:07,463 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:07,482 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:07,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:07,503 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:07,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:07,529 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-01-20 10:09:07,529 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-20 10:09:07,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-20 10:09:07,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:07,602 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-01-20 10:09:07,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:09:07,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,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 31 treesize of output 65 [2019-01-20 10:09:07,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:07,667 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-01-20 10:09:07,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:09:07,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,701 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:07,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, 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-01-20 10:09:07,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:07,734 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-01-20 10:09:07,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:09:07,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:07,767 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:07,768 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-01-20 10:09:07,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:07,799 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-01-20 10:09:07,799 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:09:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:07,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:07,872 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:07,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:07,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:09:07,893 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:07,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:09:07,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:09:07,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=170, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:09:07,893 INFO L87 Difference]: Start difference. First operand 152 states and 750 transitions. Second operand 12 states. [2019-01-20 10:09:09,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:09,959 INFO L93 Difference]: Finished difference Result 202 states and 935 transitions. [2019-01-20 10:09:09,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:09:09,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:09:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:09,961 INFO L225 Difference]: With dead ends: 202 [2019-01-20 10:09:09,961 INFO L226 Difference]: Without dead ends: 195 [2019-01-20 10:09:09,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:09:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-01-20 10:09:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 173. [2019-01-20 10:09:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2019-01-20 10:09:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 861 transitions. [2019-01-20 10:09:11,194 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 861 transitions. Word has length 9 [2019-01-20 10:09:11,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:11,194 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 861 transitions. [2019-01-20 10:09:11,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:09:11,195 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 861 transitions. [2019-01-20 10:09:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:09:11,195 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:11,195 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:11,195 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:11,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:11,195 INFO L82 PathProgramCache]: Analyzing trace with hash 770502112, now seen corresponding path program 1 times [2019-01-20 10:09:11,196 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:11,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:11,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:11,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:09:11,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:11,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:11,390 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:09:11,390 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [20], [24], [26], [28], [29] [2019-01-20 10:09:11,391 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:11,391 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:11,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:11,393 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:09:11,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:11,393 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:11,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:11,393 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 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:11,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:11,409 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:11,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:11,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-01-20 10:09:11,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,423 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-01-20 10:09:11,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,429 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-01-20 10:09:11,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,438 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-01-20 10:09:11,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,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, 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-01-20 10:09:11,448 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:11,482 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:11,496 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:11,507 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:11,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:11,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:11,536 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:09:11,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,574 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-01-20 10:09:11,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:11,615 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-01-20 10:09:11,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:11,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,656 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-01-20 10:09:11,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:11,716 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-01-20 10:09:11,716 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:11,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,755 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:11,756 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-01-20 10:09:11,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:11,806 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-01-20 10:09:11,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:09:11,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:11,848 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:11,849 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-01-20 10:09:11,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:11,902 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-01-20 10:09:11,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:09:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:11,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:12,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:12,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:09:12,007 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:12,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:09:12,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:09:12,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:09:12,007 INFO L87 Difference]: Start difference. First operand 173 states and 861 transitions. Second operand 11 states. [2019-01-20 10:09:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:13,877 INFO L93 Difference]: Finished difference Result 199 states and 939 transitions. [2019-01-20 10:09:13,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:09:13,877 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-20 10:09:13,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:13,878 INFO L225 Difference]: With dead ends: 199 [2019-01-20 10:09:13,878 INFO L226 Difference]: Without dead ends: 192 [2019-01-20 10:09:13,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:09:13,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-01-20 10:09:15,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 162. [2019-01-20 10:09:15,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-01-20 10:09:15,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 801 transitions. [2019-01-20 10:09:15,038 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 801 transitions. Word has length 9 [2019-01-20 10:09:15,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:15,038 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 801 transitions. [2019-01-20 10:09:15,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:09:15,039 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 801 transitions. [2019-01-20 10:09:15,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:09:15,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:15,039 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:15,039 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:15,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash 894315494, now seen corresponding path program 1 times [2019-01-20 10:09:15,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:15,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:15,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:15,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:15,040 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:15,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:09:15,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:15,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:15,109 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:09:15,109 INFO L207 CegarAbsIntRunner]: [0], [10], [20], [24], [26], [28], [30], [31] [2019-01-20 10:09:15,110 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:15,110 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:15,112 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:15,112 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 3. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:09:15,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:15,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:15,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:15,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 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:15,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:15,122 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:15,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:15,133 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-01-20 10:09:15,140 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-01-20 10:09:15,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:09:15,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:09:15,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,172 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-01-20 10:09:15,172 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:15,202 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:15,218 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:15,231 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:15,243 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:15,270 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-01-20 10:09:15,271 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:28, output treesize:35 [2019-01-20 10:09:15,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,333 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-01-20 10:09:15,334 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:15,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-01-20 10:09:15,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:09:15,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,438 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-01-20 10:09:15,439 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:15,484 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-01-20 10:09:15,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:09:15,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:15,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, 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-01-20 10:09:15,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:15,587 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-01-20 10:09:15,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:30 [2019-01-20 10:09:15,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:15,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:15,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:15,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:15,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-20 10:09:15,663 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:15,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-20 10:09:15,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-20 10:09:15,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:09:15,663 INFO L87 Difference]: Start difference. First operand 162 states and 801 transitions. Second operand 9 states. [2019-01-20 10:09:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:17,297 INFO L93 Difference]: Finished difference Result 196 states and 942 transitions. [2019-01-20 10:09:17,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:09:17,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-20 10:09:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:17,298 INFO L225 Difference]: With dead ends: 196 [2019-01-20 10:09:17,298 INFO L226 Difference]: Without dead ends: 187 [2019-01-20 10:09:17,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:09:17,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-01-20 10:09:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2019-01-20 10:09:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-20 10:09:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 917 transitions. [2019-01-20 10:09:18,737 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 917 transitions. Word has length 9 [2019-01-20 10:09:18,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:18,738 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 917 transitions. [2019-01-20 10:09:18,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-20 10:09:18,738 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 917 transitions. [2019-01-20 10:09:18,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:09:18,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:18,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:18,738 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:18,739 INFO L82 PathProgramCache]: Analyzing trace with hash 774869436, now seen corresponding path program 1 times [2019-01-20 10:09:18,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:18,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:18,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:18,934 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 21 [2019-01-20 10:09:18,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:09:18,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:18,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:18,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:09:18,962 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [26], [28], [30], [31] [2019-01-20 10:09:18,962 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:18,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:18,964 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:18,964 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:09:18,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:18,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:18,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:18,964 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 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:18,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:18,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:18,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:18,979 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-01-20 10:09:18,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,982 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-01-20 10:09:18,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,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 23 treesize of output 37 [2019-01-20 10:09:18,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,995 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-01-20 10:09:18,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:18,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,002 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-01-20 10:09:19,003 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,030 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,045 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,054 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,064 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,082 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-01-20 10:09:19,082 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:09:19,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,116 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-01-20 10:09:19,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,156 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-01-20 10:09:19,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:19,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,193 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-01-20 10:09:19,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,235 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-01-20 10:09:19,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:19,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,270 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:19,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:19,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, 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-01-20 10:09:19,272 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:19,320 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-01-20 10:09:19,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-20 10:09:19,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:19,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:19,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:19,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-20 10:09:19,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:19,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:19,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:19,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:09:19,413 INFO L87 Difference]: Start difference. First operand 186 states and 917 transitions. Second operand 8 states. [2019-01-20 10:09:19,993 WARN L181 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-01-20 10:09:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:21,662 INFO L93 Difference]: Finished difference Result 203 states and 968 transitions. [2019-01-20 10:09:21,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:09:21,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-20 10:09:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:21,663 INFO L225 Difference]: With dead ends: 203 [2019-01-20 10:09:21,664 INFO L226 Difference]: Without dead ends: 194 [2019-01-20 10:09:21,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:09:21,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-20 10:09:23,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 189. [2019-01-20 10:09:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-20 10:09:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 932 transitions. [2019-01-20 10:09:23,146 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 932 transitions. Word has length 9 [2019-01-20 10:09:23,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:23,146 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 932 transitions. [2019-01-20 10:09:23,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 932 transitions. [2019-01-20 10:09:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:09:23,147 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:23,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:23,147 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:23,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:23,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1804915160, now seen corresponding path program 1 times [2019-01-20 10:09:23,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:23,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:23,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:23,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:23,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:23,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:23,285 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:09:23,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:23,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:23,286 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:09:23,286 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [20], [24], [26], [28], [29] [2019-01-20 10:09:23,286 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:23,287 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:23,288 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:23,288 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:09:23,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:23,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:23,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:23,289 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 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:23,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:23,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:23,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:23,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:23,311 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-01-20 10:09:23,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,315 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-01-20 10:09:23,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,321 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-01-20 10:09:23,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,331 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-01-20 10:09:23,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,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, 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-01-20 10:09:23,344 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:23,371 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:23,386 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:23,397 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:23,406 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:23,424 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-01-20 10:09:23,424 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:09:23,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,460 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-01-20 10:09:23,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:23,504 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-01-20 10:09:23,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:23,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,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, 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-01-20 10:09:23,542 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:23,587 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-01-20 10:09:23,587 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:23,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,628 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:23,629 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 99 [2019-01-20 10:09:23,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:23,677 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-01-20 10:09:23,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:09:23,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:23,715 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:23,715 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-01-20 10:09:23,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:23,764 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-01-20 10:09:23,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:09:23,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:23,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:23,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:23,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:09:23,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:23,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:09:23,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:09:23,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:09:23,863 INFO L87 Difference]: Start difference. First operand 189 states and 932 transitions. Second operand 11 states. [2019-01-20 10:09:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:26,415 INFO L93 Difference]: Finished difference Result 269 states and 1267 transitions. [2019-01-20 10:09:26,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:09:26,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-20 10:09:26,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:26,416 INFO L225 Difference]: With dead ends: 269 [2019-01-20 10:09:26,417 INFO L226 Difference]: Without dead ends: 265 [2019-01-20 10:09:26,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:09:26,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-01-20 10:09:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 212. [2019-01-20 10:09:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-20 10:09:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1052 transitions. [2019-01-20 10:09:28,236 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1052 transitions. Word has length 9 [2019-01-20 10:09:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:28,236 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1052 transitions. [2019-01-20 10:09:28,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:09:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1052 transitions. [2019-01-20 10:09:28,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:09:28,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:28,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:28,237 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:28,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:28,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1810456286, now seen corresponding path program 1 times [2019-01-20 10:09:28,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:28,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:28,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:28,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:28,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:09:28,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:28,383 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:28,383 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:09:28,383 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [24], [26], [28], [29] [2019-01-20 10:09:28,384 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:28,384 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:28,386 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:28,386 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-20 10:09:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:28,387 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:28,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:28,387 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 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:28,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:28,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:28,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:28,406 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-01-20 10:09:28,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,413 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-01-20 10:09:28,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,418 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-01-20 10:09:28,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,423 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-01-20 10:09:28,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,432 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-01-20 10:09:28,433 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,460 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,484 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,512 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-01-20 10:09:28,512 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:09:28,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,556 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-01-20 10:09:28,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,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-01-20 10:09:28,600 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:28,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,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, 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-01-20 10:09:28,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,688 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-01-20 10:09:28,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:28,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,731 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:28,732 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 99 [2019-01-20 10:09:28,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,779 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-01-20 10:09:28,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:09:28,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:28,823 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:28,824 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 106 [2019-01-20 10:09:28,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:28,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-01-20 10:09:28,876 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:09:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:28,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:28,952 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:28,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:28,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-20 10:09:28,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:28,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:09:28,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:09:28,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=149, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:09:28,972 INFO L87 Difference]: Start difference. First operand 212 states and 1052 transitions. Second operand 11 states. [2019-01-20 10:09:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:31,520 INFO L93 Difference]: Finished difference Result 253 states and 1178 transitions. [2019-01-20 10:09:31,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:09:31,520 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 9 [2019-01-20 10:09:31,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:31,521 INFO L225 Difference]: With dead ends: 253 [2019-01-20 10:09:31,522 INFO L226 Difference]: Without dead ends: 249 [2019-01-20 10:09:31,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:09:31,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-20 10:09:33,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 214. [2019-01-20 10:09:33,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-20 10:09:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1063 transitions. [2019-01-20 10:09:33,368 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1063 transitions. Word has length 9 [2019-01-20 10:09:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:33,369 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1063 transitions. [2019-01-20 10:09:33,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:09:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1063 transitions. [2019-01-20 10:09:33,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:09:33,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:33,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:33,369 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:33,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:33,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1915676112, now seen corresponding path program 1 times [2019-01-20 10:09:33,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:33,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:33,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:33,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-20 10:09:33,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:33,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:33,466 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2019-01-20 10:09:33,466 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [24], [26], [28], [30], [31] [2019-01-20 10:09:33,466 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:33,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:33,468 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:33,468 INFO L272 AbstractInterpreter]: Visited 9 different actions 9 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 3. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:09:33,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:33,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:33,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:33,468 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 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:33,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:33,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:33,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:33,489 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-01-20 10:09:33,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,493 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-01-20 10:09:33,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,499 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-01-20 10:09:33,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,509 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-01-20 10:09:33,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,520 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-01-20 10:09:33,521 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,549 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,573 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,583 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,602 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-01-20 10:09:33,602 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:09:33,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,636 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-01-20 10:09:33,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,677 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-01-20 10:09:33,677 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:33,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,700 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,712 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-01-20 10:09:33,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,759 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-01-20 10:09:33,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:33,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:33,799 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:33,800 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-01-20 10:09:33,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:33,858 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-01-20 10:09:33,858 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:40 [2019-01-20 10:09:33,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:33,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:33,926 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:33,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:33,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 4, 4] total 10 [2019-01-20 10:09:33,946 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:33,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:09:33,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:09:33,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:09:33,946 INFO L87 Difference]: Start difference. First operand 214 states and 1063 transitions. Second operand 8 states. [2019-01-20 10:09:36,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:36,091 INFO L93 Difference]: Finished difference Result 226 states and 1087 transitions. [2019-01-20 10:09:36,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:09:36,091 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-01-20 10:09:36,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:36,092 INFO L225 Difference]: With dead ends: 226 [2019-01-20 10:09:36,092 INFO L226 Difference]: Without dead ends: 217 [2019-01-20 10:09:36,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:09:36,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-01-20 10:09:37,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2019-01-20 10:09:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-01-20 10:09:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 1059 transitions. [2019-01-20 10:09:37,931 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 1059 transitions. Word has length 9 [2019-01-20 10:09:37,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:37,931 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 1059 transitions. [2019-01-20 10:09:37,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:09:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 1059 transitions. [2019-01-20 10:09:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:09:37,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:37,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:37,932 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:37,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:37,932 INFO L82 PathProgramCache]: Analyzing trace with hash -574217252, now seen corresponding path program 2 times [2019-01-20 10:09:37,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:37,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:37,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:37,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:37,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:38,161 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2019-01-20 10:09:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-20 10:09:38,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:38,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:38,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:38,276 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:38,276 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:38,276 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 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:38,286 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:38,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:38,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:09:38,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:38,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:38,298 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-01-20 10:09:38,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,305 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-01-20 10:09:38,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,315 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-01-20 10:09:38,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,322 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-01-20 10:09:38,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,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, 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-01-20 10:09:38,330 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,359 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,375 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,387 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,416 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-01-20 10:09:38,416 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:09:38,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,457 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-01-20 10:09:38,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,499 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-01-20 10:09:38,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:38,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,534 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:38,535 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-01-20 10:09:38,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,577 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-01-20 10:09:38,578 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:09:38,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,616 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-01-20 10:09:38,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,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-01-20 10:09:38,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-20 10:09:38,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:38,700 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:38,701 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-01-20 10:09:38,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:38,750 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-01-20 10:09:38,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:09:38,779 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:38,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:38,846 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:38,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:38,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:09:38,864 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:38,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:09:38,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:09:38,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:09:38,865 INFO L87 Difference]: Start difference. First operand 214 states and 1059 transitions. Second operand 12 states. [2019-01-20 10:09:41,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:41,508 INFO L93 Difference]: Finished difference Result 258 states and 1213 transitions. [2019-01-20 10:09:41,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:09:41,508 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:09:41,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:41,510 INFO L225 Difference]: With dead ends: 258 [2019-01-20 10:09:41,510 INFO L226 Difference]: Without dead ends: 251 [2019-01-20 10:09:41,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-20 10:09:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-01-20 10:09:43,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 210. [2019-01-20 10:09:43,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-01-20 10:09:43,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 1036 transitions. [2019-01-20 10:09:43,311 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 1036 transitions. Word has length 9 [2019-01-20 10:09:43,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:43,311 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 1036 transitions. [2019-01-20 10:09:43,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:09:43,311 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 1036 transitions. [2019-01-20 10:09:43,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:09:43,312 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:43,312 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:43,312 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:43,312 INFO L82 PathProgramCache]: Analyzing trace with hash -566829084, now seen corresponding path program 2 times [2019-01-20 10:09:43,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:43,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:43,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:43,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:43,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:43,512 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2019-01-20 10:09:43,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:43,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:43,616 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:43,616 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:43,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:43,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:43,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:43,625 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:43,625 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:43,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:09:43,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:43,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:43,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 21 [2019-01-20 10:09:43,642 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-01-20 10:09:43,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:09:43,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,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, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:09:43,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,670 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-01-20 10:09:43,670 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,690 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,701 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,710 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,735 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-01-20 10:09:43,735 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:28, output treesize:35 [2019-01-20 10:09:43,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,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, 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-01-20 10:09:43,778 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,805 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-01-20 10:09:43,805 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:30 [2019-01-20 10:09:43,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,837 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:43,838 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-01-20 10:09:43,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,865 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-01-20 10:09:43,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:32 [2019-01-20 10:09:43,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,898 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-01-20 10:09:43,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,925 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-01-20 10:09:43,925 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:34 [2019-01-20 10:09:43,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:43,961 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:43,962 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-01-20 10:09:43,962 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:43,994 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-01-20 10:09:43,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:34 [2019-01-20 10:09:44,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:44,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:44,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:44,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:44,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:09:44,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:44,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:09:44,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:09:44,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:09:44,099 INFO L87 Difference]: Start difference. First operand 210 states and 1036 transitions. Second operand 12 states. [2019-01-20 10:09:46,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:46,959 INFO L93 Difference]: Finished difference Result 279 states and 1323 transitions. [2019-01-20 10:09:46,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:09:46,960 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:09:46,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:46,961 INFO L225 Difference]: With dead ends: 279 [2019-01-20 10:09:46,961 INFO L226 Difference]: Without dead ends: 272 [2019-01-20 10:09:46,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:09:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-20 10:09:48,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 229. [2019-01-20 10:09:48,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-01-20 10:09:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 1136 transitions. [2019-01-20 10:09:48,997 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 1136 transitions. Word has length 9 [2019-01-20 10:09:48,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:48,997 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 1136 transitions. [2019-01-20 10:09:48,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:09:48,997 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 1136 transitions. [2019-01-20 10:09:48,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-20 10:09:48,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:48,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:48,998 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:48,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:48,998 INFO L82 PathProgramCache]: Analyzing trace with hash -967637198, now seen corresponding path program 2 times [2019-01-20 10:09:48,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:48,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:48,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:48,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:48,999 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:49,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:09:49,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:49,186 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:49,186 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:49,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:49,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:49,186 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 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:49,195 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:49,195 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:49,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:09:49,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:49,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:49,205 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-01-20 10:09:49,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,209 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-01-20 10:09:49,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,214 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-01-20 10:09:49,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,226 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-01-20 10:09:49,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,233 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-01-20 10:09:49,234 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,274 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,285 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,295 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,313 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-01-20 10:09:49,313 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:31, output treesize:38 [2019-01-20 10:09:49,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,350 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-01-20 10:09:49,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,390 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-01-20 10:09:49,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:49,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,429 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:49,430 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-01-20 10:09:49,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,473 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-01-20 10:09:49,473 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:09:49,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,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, 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 90 [2019-01-20 10:09:49,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,557 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-01-20 10:09:49,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-20 10:09:49,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:49,609 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:49,610 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 106 [2019-01-20 10:09:49,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:49,662 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-01-20 10:09:49,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:09:49,689 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:49,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:49,749 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:49,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:49,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-20 10:09:49,767 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:49,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-20 10:09:49,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-20 10:09:49,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:09:49,768 INFO L87 Difference]: Start difference. First operand 229 states and 1136 transitions. Second operand 12 states. [2019-01-20 10:09:52,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:52,533 INFO L93 Difference]: Finished difference Result 256 states and 1217 transitions. [2019-01-20 10:09:52,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:09:52,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 9 [2019-01-20 10:09:52,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:52,535 INFO L225 Difference]: With dead ends: 256 [2019-01-20 10:09:52,535 INFO L226 Difference]: Without dead ends: 249 [2019-01-20 10:09:52,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:09:52,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-20 10:09:54,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 227. [2019-01-20 10:09:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-01-20 10:09:54,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 1126 transitions. [2019-01-20 10:09:54,599 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 1126 transitions. Word has length 9 [2019-01-20 10:09:54,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:54,599 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 1126 transitions. [2019-01-20 10:09:54,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-20 10:09:54,599 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 1126 transitions. [2019-01-20 10:09:54,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:09:54,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:54,600 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:54,600 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:54,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:54,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1119435674, now seen corresponding path program 2 times [2019-01-20 10:09:54,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:54,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:54,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:54,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:54,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-20 10:09:54,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:54,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:54,722 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:09:54,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:09:54,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:54,722 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 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:54,731 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:09:54,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:09:54,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-20 10:09:54,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:09:54,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:54,743 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-01-20 10:09:54,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, 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-01-20 10:09:54,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 29 [2019-01-20 10:09:54,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,774 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 39 [2019-01-20 10:09:54,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,789 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-01-20 10:09:54,789 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,808 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,820 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,829 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,839 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,854 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-01-20 10:09:54,855 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:28, output treesize:35 [2019-01-20 10:09:54,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,889 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-01-20 10:09:54,889 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,915 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-01-20 10:09:54,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:40, output treesize:30 [2019-01-20 10:09:54,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,942 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-01-20 10:09:54,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:54,972 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-01-20 10:09:54,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:32 [2019-01-20 10:09:54,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:54,999 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:55,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,001 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-01-20 10:09:55,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:55,034 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-01-20 10:09:55,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:30 [2019-01-20 10:09:55,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:55,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, 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 89 [2019-01-20 10:09:55,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:55,101 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-01-20 10:09:55,102 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:32 [2019-01-20 10:09:55,125 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:55,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:55,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:55,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-20 10:09:55,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:55,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-20 10:09:55,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-20 10:09:55,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-01-20 10:09:55,190 INFO L87 Difference]: Start difference. First operand 227 states and 1126 transitions. Second operand 11 states. [2019-01-20 10:09:57,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:09:57,630 INFO L93 Difference]: Finished difference Result 234 states and 1146 transitions. [2019-01-20 10:09:57,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:09:57,630 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 10 [2019-01-20 10:09:57,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:09:57,631 INFO L225 Difference]: With dead ends: 234 [2019-01-20 10:09:57,631 INFO L226 Difference]: Without dead ends: 207 [2019-01-20 10:09:57,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:09:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-20 10:09:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 51. [2019-01-20 10:09:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-20 10:09:58,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 224 transitions. [2019-01-20 10:09:58,102 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 224 transitions. Word has length 10 [2019-01-20 10:09:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:09:58,102 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 224 transitions. [2019-01-20 10:09:58,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-20 10:09:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 224 transitions. [2019-01-20 10:09:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:09:58,102 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:09:58,102 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:09:58,103 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:09:58,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:58,103 INFO L82 PathProgramCache]: Analyzing trace with hash -905277736, now seen corresponding path program 1 times [2019-01-20 10:09:58,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:09:58,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:58,103 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:09:58,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:09:58,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:09:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:58,337 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:09:58,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:58,337 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:09:58,337 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-20 10:09:58,337 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [18], [20], [24], [26], [28], [29] [2019-01-20 10:09:58,338 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:09:58,338 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:09:58,340 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:09:58,340 INFO L272 AbstractInterpreter]: Visited 10 different actions 10 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 3. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-20 10:09:58,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:09:58,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:09:58,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:09:58,341 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 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:09:58,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:09:58,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:09:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:09:58,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:09:58,361 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-01-20 10:09:58,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,363 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-01-20 10:09:58,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,368 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-01-20 10:09:58,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,374 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-01-20 10:09:58,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,380 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-01-20 10:09:58,380 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,407 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,432 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,442 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,461 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:09:58,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,502 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-01-20 10:09:58,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,543 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-01-20 10:09:58,544 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:58,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,583 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:58,584 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-01-20 10:09:58,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,625 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-01-20 10:09:58,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:58,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,666 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-01-20 10:09:58,667 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,712 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-01-20 10:09:58,712 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:48, output treesize:38 [2019-01-20 10:09:58,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,756 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:58,756 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 99 [2019-01-20 10:09:58,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,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-01-20 10:09:58,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:40 [2019-01-20 10:09:58,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:09:58,857 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:09:58,857 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-01-20 10:09:58,858 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:09:58,912 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-01-20 10:09:58,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:09:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:58,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:09:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:09:59,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:09:59,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-20 10:09:59,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:09:59,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:09:59,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:09:59,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2019-01-20 10:09:59,053 INFO L87 Difference]: Start difference. First operand 51 states and 224 transitions. Second operand 14 states. [2019-01-20 10:10:00,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:00,393 INFO L93 Difference]: Finished difference Result 76 states and 322 transitions. [2019-01-20 10:10:00,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:10:00,393 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-20 10:10:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:00,394 INFO L225 Difference]: With dead ends: 76 [2019-01-20 10:10:00,394 INFO L226 Difference]: Without dead ends: 69 [2019-01-20 10:10:00,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=413, Unknown=0, NotChecked=0, Total=600 [2019-01-20 10:10:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-20 10:10:00,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2019-01-20 10:10:00,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-20 10:10:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 239 transitions. [2019-01-20 10:10:00,921 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 239 transitions. Word has length 10 [2019-01-20 10:10:00,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:00,921 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 239 transitions. [2019-01-20 10:10:00,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:10:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 239 transitions. [2019-01-20 10:10:00,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:10:00,922 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:00,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:10:00,922 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:00,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:00,922 INFO L82 PathProgramCache]: Analyzing trace with hash -62458648, now seen corresponding path program 2 times [2019-01-20 10:10:00,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:00,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:00,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:00,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:00,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:01,136 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:01,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:01,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:01,137 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:10:01,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:10:01,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:01,137 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 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:01,151 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:10:01,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:10:01,159 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-20 10:10:01,159 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:10:01,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:01,166 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-01-20 10:10:01,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,169 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-01-20 10:10:01,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,172 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-01-20 10:10:01,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,178 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-01-20 10:10:01,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,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, 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-01-20 10:10:01,185 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,214 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,228 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,240 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,250 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,274 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,274 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:10:01,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,344 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-01-20 10:10:01,345 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,395 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-01-20 10:10:01,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:10:01,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,436 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-01-20 10:10:01,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,482 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-01-20 10:10:01,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:10:01,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,526 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:01,526 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 99 [2019-01-20 10:10:01,527 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,575 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-01-20 10:10:01,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:10:01,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,621 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:01,622 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-01-20 10:10:01,623 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,667 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-01-20 10:10:01,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-20 10:10:01,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:01,710 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:01,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, 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-01-20 10:10:01,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:01,760 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-01-20 10:10:01,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:10:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:01,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:01,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:01,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-20 10:10:01,884 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:01,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:10:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:10:01,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:10:01,885 INFO L87 Difference]: Start difference. First operand 54 states and 239 transitions. Second operand 13 states. [2019-01-20 10:10:03,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:03,202 INFO L93 Difference]: Finished difference Result 75 states and 318 transitions. [2019-01-20 10:10:03,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:10:03,202 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-20 10:10:03,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:03,203 INFO L225 Difference]: With dead ends: 75 [2019-01-20 10:10:03,203 INFO L226 Difference]: Without dead ends: 68 [2019-01-20 10:10:03,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:10:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-20 10:10:03,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2019-01-20 10:10:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 10:10:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 206 transitions. [2019-01-20 10:10:03,709 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 206 transitions. Word has length 10 [2019-01-20 10:10:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:03,709 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 206 transitions. [2019-01-20 10:10:03,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:10:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 206 transitions. [2019-01-20 10:10:03,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:10:03,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:03,709 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:10:03,709 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:03,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:03,710 INFO L82 PathProgramCache]: Analyzing trace with hash -127091828, now seen corresponding path program 3 times [2019-01-20 10:10:03,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:03,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:03,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:10:03,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:03,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:03,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:04,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:04,003 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:04,003 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:10:04,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:10:04,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:04,003 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 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:04,010 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-20 10:10:04,011 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-20 10:10:04,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-20 10:10:04,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:10:04,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:04,019 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-01-20 10:10:04,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,021 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-01-20 10:10:04,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,026 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-01-20 10:10:04,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,033 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-01-20 10:10:04,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,041 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-01-20 10:10:04,041 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,069 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,095 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,123 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:10:04,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,165 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-01-20 10:10:04,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,204 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-01-20 10:10:04,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:10:04,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,248 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-01-20 10:10:04,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,297 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-01-20 10:10:04,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:38 [2019-01-20 10:10:04,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,341 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:04,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, 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 99 [2019-01-20 10:10:04,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,390 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-01-20 10:10:04,391 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:50, output treesize:40 [2019-01-20 10:10:04,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,436 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:04,437 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-01-20 10:10:04,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,486 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-01-20 10:10:04,486 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-20 10:10:04,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:04,527 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:04,528 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-01-20 10:10:04,528 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:04,574 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-01-20 10:10:04,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:10:04,604 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:04,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:04,675 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:04,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:04,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-01-20 10:10:04,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:04,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-20 10:10:04,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-20 10:10:04,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=217, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:10:04,694 INFO L87 Difference]: Start difference. First operand 47 states and 206 transitions. Second operand 14 states. [2019-01-20 10:10:06,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:06,500 INFO L93 Difference]: Finished difference Result 97 states and 409 transitions. [2019-01-20 10:10:06,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-20 10:10:06,500 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 10 [2019-01-20 10:10:06,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:06,500 INFO L225 Difference]: With dead ends: 97 [2019-01-20 10:10:06,500 INFO L226 Difference]: Without dead ends: 84 [2019-01-20 10:10:06,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=173, Invalid=333, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:10:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-20 10:10:07,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2019-01-20 10:10:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-20 10:10:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 266 transitions. [2019-01-20 10:10:07,301 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 266 transitions. Word has length 10 [2019-01-20 10:10:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:07,301 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 266 transitions. [2019-01-20 10:10:07,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-20 10:10:07,301 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 266 transitions. [2019-01-20 10:10:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-20 10:10:07,301 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:07,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-20 10:10:07,301 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:07,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:07,302 INFO L82 PathProgramCache]: Analyzing trace with hash 230496124, now seen corresponding path program 4 times [2019-01-20 10:10:07,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:07,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:07,302 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:10:07,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:07,302 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:07,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:07,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:07,537 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:07,537 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:10:07,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-20 10:10:07,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:07,537 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 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-20 10:10:07,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:07,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:07,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:07,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:07,554 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-01-20 10:10:07,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,559 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-01-20 10:10:07,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,564 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-01-20 10:10:07,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,577 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-01-20 10:10:07,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,591 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-01-20 10:10:07,591 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,618 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,633 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,645 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,672 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:31, output treesize:38 [2019-01-20 10:10:07,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,715 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-01-20 10:10:07,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,758 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-01-20 10:10:07,758 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:38 [2019-01-20 10:10:07,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,798 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:07,799 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-01-20 10:10:07,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,844 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-01-20 10:10:07,844 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:40 [2019-01-20 10:10:07,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,930 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 90 [2019-01-20 10:10:07,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:07,978 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-01-20 10:10:07,979 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:42 [2019-01-20 10:10:08,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,022 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:08,022 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-01-20 10:10:08,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,074 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-01-20 10:10:08,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:42 [2019-01-20 10:10:08,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,119 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:08,119 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-01-20 10:10:08,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,170 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-01-20 10:10:08,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-20 10:10:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:08,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:08,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:08,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-20 10:10:08,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:08,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-20 10:10:08,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-20 10:10:08,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-20 10:10:08,309 INFO L87 Difference]: Start difference. First operand 58 states and 266 transitions. Second operand 13 states. [2019-01-20 10:10:09,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:09,814 INFO L93 Difference]: Finished difference Result 67 states and 299 transitions. [2019-01-20 10:10:09,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:10:09,814 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 10 [2019-01-20 10:10:09,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:09,815 INFO L225 Difference]: With dead ends: 67 [2019-01-20 10:10:09,815 INFO L226 Difference]: Without dead ends: 0 [2019-01-20 10:10:09,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2019-01-20 10:10:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-20 10:10:09,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-20 10:10:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-20 10:10:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-20 10:10:09,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2019-01-20 10:10:09,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:09,816 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-20 10:10:09,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-20 10:10:09,816 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-20 10:10:09,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-20 10:10:09,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-20 10:10:10,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:10,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:10,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:10,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:11,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:11,076 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:11,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:11,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:11,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:11,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:11,779 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:11,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:11,976 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,367 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,496 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,603 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,634 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:12,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:13,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:13,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:13,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:13,655 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:13,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:13,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:17,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:18,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:19,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:24,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:24,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:24,700 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:26,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:26,138 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:30,492 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:30,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:30,880 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:31,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:31,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:31,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:31,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:31,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:31,824 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:31,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:31,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:31,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:31,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:34,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:44,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:45,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:45,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:45,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:45,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:45,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:10:50,549 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:02,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:09,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:10,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:10,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:10,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:17,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:18,102 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:18,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:18,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:18,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:18,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:26,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:26,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:29,657 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:29,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:29,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:29,736 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:29,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:29,750 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:11:36,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:12:15,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:12:28,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:12:29,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:12:29,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:12:47,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:12:47,525 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:12:47,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-20 10:12:53,925 WARN L181 SmtUtils]: Spent 2.73 m on a formula simplification. DAG size of input: 5253 DAG size of output: 4236 [2019-01-20 10:16:41,544 WARN L181 SmtUtils]: Spent 3.79 m on a formula simplification. DAG size of input: 3967 DAG size of output: 124 [2019-01-20 10:16:41,548 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 7 9) no Hoare annotation was computed. [2019-01-20 10:16:41,548 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-20 10:16:41,548 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-01-20 10:16:41,548 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONASSERT(line 50) no Hoare annotation was computed. [2019-01-20 10:16:41,548 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 7 9) no Hoare annotation was computed. [2019-01-20 10:16:41,548 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONASSERT(line 49) no Hoare annotation was computed. [2019-01-20 10:16:41,548 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-01-20 10:16:41,548 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-01-20 10:16:41,548 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-20 10:16:41,549 INFO L448 ceAbstractionStarter]: For program point L14(lines 7 54) no Hoare annotation was computed. [2019-01-20 10:16:41,549 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONASSERT(line 52) no Hoare annotation was computed. [2019-01-20 10:16:41,549 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 34 46) the Hoare annotation is: (let ((.cse14 (select |#memory_int| ULTIMATE.start_main_p4)) (.cse0 (select |#memory_int| ULTIMATE.start_main_p5))) (let ((.cse26 (store |#memory_int| ULTIMATE.start_main_p5 (+ .cse0 1))) (.cse27 (store |#memory_int| ULTIMATE.start_main_p4 (+ .cse14 (- 1))))) (let ((.cse15 (select |#memory_int| ULTIMATE.start_main_p1)) (.cse10 (select .cse27 ULTIMATE.start_main_p1)) (.cse25 (select .cse26 ULTIMATE.start_main_p4)) (.cse5 (select |#memory_int| ULTIMATE.start_main_p3))) (let ((.cse4 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p2))) (.cse1 (select |#memory_int| ULTIMATE.start_main_p2)) (.cse2 (= .cse5 0)) (.cse11 (= 0 .cse25)) (.cse16 (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p2))) (.cse13 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p3))) (.cse6 (select .cse26 ULTIMATE.start_main_p2)) (.cse3 (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p5))) (.cse23 (= 0 .cse10)) (.cse17 (<= 0 .cse0)) (.cse9 (select .cse27 ULTIMATE.start_main_p3)) (.cse21 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p3))) (.cse8 (= 0 (select .cse27 ULTIMATE.start_main_p2))) (.cse12 (<= 1 (select .cse27 ULTIMATE.start_main_p5))) (.cse19 (= 0 (select .cse26 ULTIMATE.start_main_p1))) (.cse18 (store |#memory_int| ULTIMATE.start_main_p1 (+ .cse15 1))) (.cse7 (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p1)))) (or (and (and (not (= ULTIMATE.start_main_p3 ULTIMATE.start_main_p5)) (= .cse0 0) (= 0 (select (store |#memory_int| ULTIMATE.start_main_p2 (+ .cse1 (- 1))) ULTIMATE.start_main_p1)) .cse2 .cse3 .cse4 (<= (+ (select (store |#memory_int| ULTIMATE.start_main_p3 (+ .cse5 1)) ULTIMATE.start_main_p4) 1) 0) (<= .cse6 0)) .cse7) (and (and .cse8 (and (= 0 .cse9) (and (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (<= 0 .cse10)))) .cse11 .cse12 .cse13 .cse4) (and (= 0 .cse0) (= .cse14 0) (<= .cse1 0) (< ULTIMATE.start_main_p3 ULTIMATE.start_main_p4) .cse2 (< ULTIMATE.start_main_p2 ULTIMATE.start_main_p3) (<= 0 .cse15) (< ULTIMATE.start_main_p4 ULTIMATE.start_main_p5) (< ULTIMATE.start_main_p1 ULTIMATE.start_main_p2)) (and (and (and (and (and (and .cse16 .cse17) (= 0 (select .cse18 ULTIMATE.start_main_p2)) .cse19) (<= 1 .cse5)) .cse11) (not (= ULTIMATE.start_main_p4 ULTIMATE.start_main_p2))) (not (= ULTIMATE.start_main_p1 ULTIMATE.start_main_p4))) (and (<= .cse14 0) (<= 0 .cse9) (and (not (= ULTIMATE.start_main_p5 ULTIMATE.start_main_p4)) .cse17 (let ((.cse20 (<= 1 .cse10)) (.cse22 (<= (+ .cse6 1) 0))) (or (and .cse20 .cse8 .cse21 .cse16) (and .cse22 .cse20) (and .cse3 .cse22 .cse23 .cse13))))) (let ((.cse24 (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p1)))) (or (and (and (and (and (not (= ULTIMATE.start_main_p2 ULTIMATE.start_main_p5)) .cse3 .cse8 .cse24 .cse23) .cse17) (<= 1 .cse9)) (<= (+ .cse25 1) 0)) (and (and .cse21 .cse8 .cse12 .cse24 .cse19 (<= (+ (select .cse18 ULTIMATE.start_main_p4) 1) 0)) (= 0 (select .cse26 ULTIMATE.start_main_p3)) .cse7)))))))) [2019-01-20 10:16:41,550 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONASSERT(line 51) no Hoare annotation was computed. [2019-01-20 10:16:41,588 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-5-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 10:16:41 BoogieIcfgContainer [2019-01-20 10:16:41,589 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-20 10:16:41,594 INFO L168 Benchmark]: Toolchain (without parser) took 699140.84 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 106.3 MB in the beginning and 348.2 MB in the end (delta: -241.9 MB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2019-01-20 10:16:41,594 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-20 10:16:41,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.04 ms. Allocated memory is still 138.9 MB. Free memory was 106.3 MB in the beginning and 103.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-01-20 10:16:41,595 INFO L168 Benchmark]: Boogie Preprocessor took 23.48 ms. Allocated memory is still 138.9 MB. Free memory was 103.9 MB in the beginning and 102.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-20 10:16:41,595 INFO L168 Benchmark]: RCFGBuilder took 413.99 ms. Allocated memory is still 138.9 MB. Free memory was 102.8 MB in the beginning and 91.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2019-01-20 10:16:41,595 INFO L168 Benchmark]: TraceAbstraction took 698637.37 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 91.4 MB in the beginning and 348.2 MB in the end (delta: -256.8 MB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. [2019-01-20 10:16:41,597 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 138.9 MB. Free memory is still 107.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.04 ms. Allocated memory is still 138.9 MB. Free memory was 106.3 MB in the beginning and 103.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.48 ms. Allocated memory is still 138.9 MB. Free memory was 103.9 MB in the beginning and 102.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 413.99 ms. Allocated memory is still 138.9 MB. Free memory was 102.8 MB in the beginning and 91.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 698637.37 ms. Allocated memory was 138.9 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 91.4 MB in the beginning and 348.2 MB in the end (delta: -256.8 MB). Peak memory consumption was 3.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 49]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 52]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 50]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: ((((((((((((!(p3 == p5) && #memory_int[p5] == 0) && 0 == #memory_int[p2 := #memory_int[p2] + -1][p1]) && #memory_int[p3] == 0) && !(p1 == p5)) && !(p3 == p2)) && #memory_int[p3 := #memory_int[p3] + 1][p4] + 1 <= 0) && #memory_int[p5 := #memory_int[p5] + 1][p2] <= 0) && !(p3 == p1)) || (((((0 == #memory_int[p4 := #memory_int[p4] + -1][p2] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p3] && !(p1 == p2) && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p1 == p3)) && !(p3 == p2))) || ((((((((0 == #memory_int[p5] && #memory_int[p4] == 0) && #memory_int[p2] <= 0) && p3 < p4) && #memory_int[p3] == 0) && p2 < p3) && 0 <= #memory_int[p1]) && p4 < p5) && p1 < p2)) || (((((((!(p5 == p2) && 0 <= #memory_int[p5]) && 0 == #memory_int[p1 := #memory_int[p1] + 1][p2]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && 1 <= #memory_int[p3]) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p4]) && !(p4 == p2)) && !(p1 == p4))) || ((#memory_int[p4] <= 0 && 0 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && (!(p5 == p4) && 0 <= #memory_int[p5]) && (((((1 <= #memory_int[p4 := #memory_int[p4] + -1][p1] && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p3)) && !(p5 == p2)) || (#memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0 && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p1])) || (((!(p1 == p5) && #memory_int[p5 := #memory_int[p5] + 1][p2] + 1 <= 0) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && !(p1 == p3))))) || (((((((!(p2 == p5) && !(p1 == p5)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && !(p2 == p1)) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p1]) && 0 <= #memory_int[p5]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p3]) && #memory_int[p5 := #memory_int[p5] + 1][p4] + 1 <= 0) || (((((((!(p2 == p3) && 0 == #memory_int[p4 := #memory_int[p4] + -1][p2]) && 1 <= #memory_int[p4 := #memory_int[p4] + -1][p5]) && !(p2 == p1)) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p1]) && #memory_int[p1 := #memory_int[p1] + 1][p4] + 1 <= 0) && 0 == #memory_int[p5 := #memory_int[p5] + 1][p3]) && !(p3 == p1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 5 error locations. SAFE Result, 698.5s OverallTime, 146 OverallIterations, 2 TraceHistogramMax, 141.7s AutomataDifference, 0.0s DeadEndRemovalTime, 391.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 710 SDtfs, 3208 SDslu, 1 SDs, 0 SdLazy, 36534 SolverSat, 1932 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2696 GetRequests, 573 SyntacticMatches, 121 SemanticMatches, 2002 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8683 ImplicationChecksByTransitivity, 60.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=446occurred in iteration=104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.6s AbstIntTime, 104 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 60.0s AutomataMinimizationTime, 146 MinimizatonAttempts, 5533 StatesRemovedByMinimization, 142 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 77 NumberOfFragments, 517 HoareAnnotationTreeSize, 1 FomulaSimplifications, 6385741493603791 FormulaSimplificationTreeSizeReduction, 164.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 1235314563251 FormulaSimplificationTreeSizeReductionInter, 227.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 97.7s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 345 NumberOfCheckSat, 2455 ConstructedInterpolants, 768 QuantifiedInterpolants, 388476 SizeOfPredicates, 568 NumberOfNonLiveVariables, 3796 ConjunctsInSsa, 1211 ConjunctsInUnsatCore, 430 InterpolantComputations, 9 PerfectInterpolantSequences, 487/2868 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...