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-7-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-20 10:10:05,365 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-20 10:10:05,367 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-20 10:10:05,386 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-20 10:10:05,386 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-20 10:10:05,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-20 10:10:05,389 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-20 10:10:05,392 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-20 10:10:05,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-20 10:10:05,396 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-20 10:10:05,397 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-20 10:10:05,400 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-20 10:10:05,401 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-20 10:10:05,402 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-20 10:10:05,405 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-20 10:10:05,406 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-20 10:10:05,407 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-20 10:10:05,409 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-20 10:10:05,420 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-20 10:10:05,425 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-20 10:10:05,426 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-20 10:10:05,429 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-20 10:10:05,434 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-20 10:10:05,434 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-20 10:10:05,434 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-20 10:10:05,435 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-20 10:10:05,436 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-20 10:10:05,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-20 10:10:05,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-20 10:10:05,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-20 10:10:05,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-20 10:10:05,445 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-20 10:10:05,446 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-20 10:10:05,446 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-20 10:10:05,447 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-20 10:10:05,449 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-20 10:10:05,449 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:10:05,473 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-20 10:10:05,474 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-20 10:10:05,475 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-20 10:10:05,476 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-20 10:10:05,476 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-20 10:10:05,476 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-20 10:10:05,476 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-20 10:10:05,477 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-20 10:10:05,477 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-20 10:10:05,477 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-20 10:10:05,477 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-20 10:10:05,477 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-20 10:10:05,478 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-20 10:10:05,478 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-20 10:10:05,479 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-20 10:10:05,479 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-20 10:10:05,479 INFO L133 SettingsManager]: * Use SBE=true [2019-01-20 10:10:05,480 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-20 10:10:05,480 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-20 10:10:05,480 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-20 10:10:05,480 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-20 10:10:05,481 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-20 10:10:05,482 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-20 10:10:05,482 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-20 10:10:05,483 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-20 10:10:05,483 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-20 10:10:05,483 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-20 10:10:05,483 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-20 10:10:05,483 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-20 10:10:05,484 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-20 10:10:05,484 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-20 10:10:05,484 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-20 10:10:05,484 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-20 10:10:05,484 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-20 10:10:05,485 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-20 10:10:05,485 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-20 10:10:05,485 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-20 10:10:05,485 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-20 10:10:05,485 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-20 10:10:05,486 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-20 10:10:05,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-20 10:10:05,548 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-20 10:10:05,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-20 10:10:05,555 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-20 10:10:05,555 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-20 10:10:05,557 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl [2019-01-20 10:10:05,557 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-unlimited.bpl' [2019-01-20 10:10:05,613 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-20 10:10:05,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-20 10:10:05,616 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-20 10:10:05,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-20 10:10:05,616 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-20 10:10:05,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:05" (1/1) ... [2019-01-20 10:10:05,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:05" (1/1) ... [2019-01-20 10:10:05,674 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-20 10:10:05,675 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-20 10:10:05,675 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-20 10:10:05,675 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-20 10:10:05,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:05" (1/1) ... [2019-01-20 10:10:05,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:05" (1/1) ... [2019-01-20 10:10:05,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:05" (1/1) ... [2019-01-20 10:10:05,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:05" (1/1) ... [2019-01-20 10:10:05,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:05" (1/1) ... [2019-01-20 10:10:05,696 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:05" (1/1) ... [2019-01-20 10:10:05,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:05" (1/1) ... [2019-01-20 10:10:05,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-20 10:10:05,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-20 10:10:05,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-20 10:10:05,701 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-20 10:10:05,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:05" (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:10:05,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-20 10:10:05,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-20 10:10:06,126 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-20 10:10:06,126 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-20 10:10:06,128 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:10:06 BoogieIcfgContainer [2019-01-20 10:10:06,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-20 10:10:06,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-20 10:10:06,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-20 10:10:06,140 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-20 10:10:06,143 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 20.01 10:10:05" (1/2) ... [2019-01-20 10:10:06,144 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1360ad86 and model type speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 10:10:06, skipping insertion in model container [2019-01-20 10:10:06,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-7-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 10:10:06" (2/2) ... [2019-01-20 10:10:06,146 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-7-unlimited.bpl [2019-01-20 10:10:06,169 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-20 10:10:06,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2019-01-20 10:10:06,206 INFO L257 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-01-20 10:10:06,239 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-20 10:10:06,239 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-20 10:10:06,239 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-20 10:10:06,239 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-20 10:10:06,240 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-20 10:10:06,240 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-20 10:10:06,240 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-20 10:10:06,240 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-20 10:10:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-01-20 10:10:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-20 10:10:06,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:06,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-20 10:10:06,266 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:06,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:06,273 INFO L82 PathProgramCache]: Analyzing trace with hash 992, now seen corresponding path program 1 times [2019-01-20 10:10:06,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:06,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:06,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:06,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:06,505 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:10:06,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:10:06,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:10:06,508 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:06,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:10:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:10:06,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:10:06,528 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-01-20 10:10:06,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:06,767 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2019-01-20 10:10:06,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:10:06,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-20 10:10:06,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:06,783 INFO L225 Difference]: With dead ends: 33 [2019-01-20 10:10:06,783 INFO L226 Difference]: Without dead ends: 28 [2019-01-20 10:10:06,786 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:10:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-20 10:10:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 16. [2019-01-20 10:10:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-20 10:10:06,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 29 transitions. [2019-01-20 10:10:06,818 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 29 transitions. Word has length 2 [2019-01-20 10:10:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:06,820 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 29 transitions. [2019-01-20 10:10:06,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:10:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 29 transitions. [2019-01-20 10:10:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:10:06,821 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:06,821 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:10:06,822 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:06,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash 30816, now seen corresponding path program 1 times [2019-01-20 10:10:06,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:06,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:06,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:06,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:06,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:06,889 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:10:06,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:10:06,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-20 10:10:06,890 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:06,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-20 10:10:06,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-20 10:10:06,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-20 10:10:06,893 INFO L87 Difference]: Start difference. First operand 16 states and 29 transitions. Second operand 3 states. [2019-01-20 10:10:07,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:07,246 INFO L93 Difference]: Finished difference Result 28 states and 40 transitions. [2019-01-20 10:10:07,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:10:07,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-20 10:10:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:07,248 INFO L225 Difference]: With dead ends: 28 [2019-01-20 10:10:07,248 INFO L226 Difference]: Without dead ends: 27 [2019-01-20 10:10:07,249 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:10:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-20 10:10:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 17. [2019-01-20 10:10:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-20 10:10:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 30 transitions. [2019-01-20 10:10:07,254 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 30 transitions. Word has length 3 [2019-01-20 10:10:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:07,254 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 30 transitions. [2019-01-20 10:10:07,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-20 10:10:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 30 transitions. [2019-01-20 10:10:07,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:10:07,255 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:07,255 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:10:07,255 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:07,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:07,256 INFO L82 PathProgramCache]: Analyzing trace with hash 30380, now seen corresponding path program 1 times [2019-01-20 10:10:07,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:07,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:07,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:07,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:07,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:07,407 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:10:07,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:07,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:07,409 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:10:07,410 INFO L207 CegarAbsIntRunner]: [0], [18], [31] [2019-01-20 10:10:07,452 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:07,452 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:07,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:07,515 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:07,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:07,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:07,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:07,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 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:10:07,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:07,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:07,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:07,559 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:07,801 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-20 10:10:07,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:07,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:07,984 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-01-20 10:10:07,995 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,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:08,200 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-01-20 10:10:08,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:08,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:08,810 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-20 10:10:08,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:08,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:08,845 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,896 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,945 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:08,991 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:09,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:10:09,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-20 10:10:09,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:09,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:09,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:09,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:09,273 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,442 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,524 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,566 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,591 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,608 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,623 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,700 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:09,701 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:09,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:09,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:10:09,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:09,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:09,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:09,965 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:10:09,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:10,064 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:10:10,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:10,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:10:10,084 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:10,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:10:10,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:10:10,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:10,085 INFO L87 Difference]: Start difference. First operand 17 states and 30 transitions. Second operand 6 states. [2019-01-20 10:10:10,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:10,449 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2019-01-20 10:10:10,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:10:10,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:10:10,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:10,453 INFO L225 Difference]: With dead ends: 54 [2019-01-20 10:10:10,453 INFO L226 Difference]: Without dead ends: 52 [2019-01-20 10:10:10,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:10:10,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-20 10:10:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 20. [2019-01-20 10:10:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-20 10:10:10,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 41 transitions. [2019-01-20 10:10:10,460 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 41 transitions. Word has length 3 [2019-01-20 10:10:10,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:10,460 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 41 transitions. [2019-01-20 10:10:10,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:10:10,460 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 41 transitions. [2019-01-20 10:10:10,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:10:10,461 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:10,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:10:10,462 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:10,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:10,462 INFO L82 PathProgramCache]: Analyzing trace with hash 30008, now seen corresponding path program 1 times [2019-01-20 10:10:10,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:10,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:10,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:10,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:10,518 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:10:10,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:10,519 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:10,519 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:10:10,519 INFO L207 CegarAbsIntRunner]: [0], [6], [31] [2019-01-20 10:10:10,521 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:10,521 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:10,529 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:10,529 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:10,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:10,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:10,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:10,530 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:10:10,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:10,541 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:10,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:10,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:10,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 27 treesize of output 33 [2019-01-20 10:10:10,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,641 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 29 treesize of output 43 [2019-01-20 10:10:10,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:10,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,716 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:10,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:10,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:10,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:10,776 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,817 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,884 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,912 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,949 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:10,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:11,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:11,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:11,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,226 INFO L303 Elim1Store]: Index analysis took 106 ms [2019-01-20 10:10:11,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:11,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,298 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:11,450 WARN L181 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2019-01-20 10:10:11,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:11,467 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:11,494 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:11,541 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:11,597 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:11,655 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:11,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:11,719 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:11,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:11,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:11,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:11,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:11,962 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:12,009 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:10:12,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:12,019 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:10:12,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:10:12,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:10:12,040 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:12,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:10:12,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:10:12,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:10:12,041 INFO L87 Difference]: Start difference. First operand 20 states and 41 transitions. Second operand 4 states. [2019-01-20 10:10:12,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:12,111 INFO L93 Difference]: Finished difference Result 25 states and 67 transitions. [2019-01-20 10:10:12,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:10:12,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-20 10:10:12,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:12,113 INFO L225 Difference]: With dead ends: 25 [2019-01-20 10:10:12,113 INFO L226 Difference]: Without dead ends: 24 [2019-01-20 10:10:12,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:10:12,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-20 10:10:12,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-01-20 10:10:12,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-20 10:10:12,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 66 transitions. [2019-01-20 10:10:12,121 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 66 transitions. Word has length 3 [2019-01-20 10:10:12,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:12,122 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 66 transitions. [2019-01-20 10:10:12,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:10:12,122 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 66 transitions. [2019-01-20 10:10:12,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:10:12,122 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:12,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:10:12,123 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:12,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:12,124 INFO L82 PathProgramCache]: Analyzing trace with hash 30132, now seen corresponding path program 1 times [2019-01-20 10:10:12,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:12,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:12,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:12,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:12,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:12,209 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:10:12,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:12,210 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:12,210 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:10:12,210 INFO L207 CegarAbsIntRunner]: [0], [10], [31] [2019-01-20 10:10:12,212 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:12,212 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:12,219 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:12,219 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:12,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:12,220 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:12,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:12,220 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:10:12,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:12,233 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:12,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:12,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:12,286 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 27 treesize of output 33 [2019-01-20 10:10:12,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,293 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 29 treesize of output 43 [2019-01-20 10:10:12,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,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 31 treesize of output 57 [2019-01-20 10:10:12,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,486 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-20 10:10:12,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:12,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,628 INFO L303 Elim1Store]: Index analysis took 134 ms [2019-01-20 10:10:12,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:12,662 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:12,662 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,739 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,777 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,804 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,839 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:12,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:12,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:12,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:13,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:13,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,077 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:13,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:13,153 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,179 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,204 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,231 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,258 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:13,309 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:13,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:13,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:13,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:13,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:13,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:13,550 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:10:13,550 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:13,562 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:10:13,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:13,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:10:13,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:13,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:10:13,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:10:13,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:13,584 INFO L87 Difference]: Start difference. First operand 23 states and 66 transitions. Second operand 6 states. [2019-01-20 10:10:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:13,900 INFO L93 Difference]: Finished difference Result 57 states and 111 transitions. [2019-01-20 10:10:13,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:10:13,900 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:10:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:13,902 INFO L225 Difference]: With dead ends: 57 [2019-01-20 10:10:13,902 INFO L226 Difference]: Without dead ends: 56 [2019-01-20 10:10:13,903 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:10:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-20 10:10:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 25. [2019-01-20 10:10:13,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-20 10:10:13,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 82 transitions. [2019-01-20 10:10:13,912 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 82 transitions. Word has length 3 [2019-01-20 10:10:13,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:13,912 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 82 transitions. [2019-01-20 10:10:13,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:10:13,912 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 82 transitions. [2019-01-20 10:10:13,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-20 10:10:13,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:13,913 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-20 10:10:13,913 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:13,913 INFO L82 PathProgramCache]: Analyzing trace with hash 30628, now seen corresponding path program 1 times [2019-01-20 10:10:13,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:13,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:13,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:13,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:13,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:14,003 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:10:14,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:14,004 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:14,004 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-20 10:10:14,004 INFO L207 CegarAbsIntRunner]: [0], [26], [31] [2019-01-20 10:10:14,006 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:14,006 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:14,013 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:14,013 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 74 root evaluator evaluations with a maximum evaluation depth of 2. Performed 74 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:14,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:14,013 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:14,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:14,014 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:10:14,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:14,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:14,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:14,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:14,070 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 27 treesize of output 33 [2019-01-20 10:10:14,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,093 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 29 treesize of output 43 [2019-01-20 10:10:14,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,104 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 31 treesize of output 57 [2019-01-20 10:10:14,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,117 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:14,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:14,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:14,153 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,196 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,230 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,255 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,275 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,292 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:14,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:14,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:14,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,525 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:14,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:14,599 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,626 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,656 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,680 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,708 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:14,757 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:14,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:14,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:14,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:14,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:14,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:14,920 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:10:14,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:14,948 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:10:14,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:14,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:10:14,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:14,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:10:14,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:10:14,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:14,969 INFO L87 Difference]: Start difference. First operand 25 states and 82 transitions. Second operand 6 states. [2019-01-20 10:10:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:15,330 INFO L93 Difference]: Finished difference Result 59 states and 127 transitions. [2019-01-20 10:10:15,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:10:15,331 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-20 10:10:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:15,332 INFO L225 Difference]: With dead ends: 59 [2019-01-20 10:10:15,332 INFO L226 Difference]: Without dead ends: 57 [2019-01-20 10:10:15,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:15,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-20 10:10:15,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-20 10:10:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-20 10:10:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 101 transitions. [2019-01-20 10:10:15,341 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 101 transitions. Word has length 3 [2019-01-20 10:10:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:15,342 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 101 transitions. [2019-01-20 10:10:15,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:10:15,342 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 101 transitions. [2019-01-20 10:10:15,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:15,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:15,343 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:15,343 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:15,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:15,344 INFO L82 PathProgramCache]: Analyzing trace with hash 955362, now seen corresponding path program 1 times [2019-01-20 10:10:15,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:15,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:15,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:15,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:15,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:15,504 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:10:15,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:10:15,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:10:15,505 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:15,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:10:15,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:10:15,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:10:15,505 INFO L87 Difference]: Start difference. First operand 29 states and 101 transitions. Second operand 4 states. [2019-01-20 10:10:15,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:15,738 INFO L93 Difference]: Finished difference Result 37 states and 114 transitions. [2019-01-20 10:10:15,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-20 10:10:15,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:10:15,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:15,740 INFO L225 Difference]: With dead ends: 37 [2019-01-20 10:10:15,740 INFO L226 Difference]: Without dead ends: 36 [2019-01-20 10:10:15,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-20 10:10:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-20 10:10:15,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-01-20 10:10:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-20 10:10:15,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 111 transitions. [2019-01-20 10:10:15,748 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 111 transitions. Word has length 4 [2019-01-20 10:10:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:15,748 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 111 transitions. [2019-01-20 10:10:15,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:10:15,749 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 111 transitions. [2019-01-20 10:10:15,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:15,749 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:15,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:15,750 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:15,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:15,750 INFO L82 PathProgramCache]: Analyzing trace with hash 941844, now seen corresponding path program 1 times [2019-01-20 10:10:15,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:15,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:15,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:15,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:15,751 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:15,871 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:10:15,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:15,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:15,871 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:15,872 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [33] [2019-01-20 10:10:15,873 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:15,873 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:15,883 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:15,883 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:15,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:15,884 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:15,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:15,884 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:10:15,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:15,893 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:15,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:15,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:15,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:15,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:16,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:16,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,098 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:16,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:16,174 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,200 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,225 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,253 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:16,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:10:16,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, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-20 10:10:16,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:16,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:16,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:16,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:16,399 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,441 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,471 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,495 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,512 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,527 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,542 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:16,868 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:16,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:16,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:10:16,916 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:16,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:16,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:17,004 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:10:17,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:17,103 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:10:17,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-20 10:10:17,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-20 10:10:17,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:17,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:10:17,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:10:17,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:10:17,125 INFO L87 Difference]: Start difference. First operand 32 states and 111 transitions. Second operand 4 states. [2019-01-20 10:10:17,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:17,220 INFO L93 Difference]: Finished difference Result 36 states and 122 transitions. [2019-01-20 10:10:17,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:10:17,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:10:17,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:17,222 INFO L225 Difference]: With dead ends: 36 [2019-01-20 10:10:17,222 INFO L226 Difference]: Without dead ends: 35 [2019-01-20 10:10:17,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-20 10:10:17,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-20 10:10:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-01-20 10:10:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-20 10:10:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 121 transitions. [2019-01-20 10:10:17,229 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 121 transitions. Word has length 4 [2019-01-20 10:10:17,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:17,230 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 121 transitions. [2019-01-20 10:10:17,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:10:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 121 transitions. [2019-01-20 10:10:17,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:17,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:17,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:17,231 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:17,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:17,231 INFO L82 PathProgramCache]: Analyzing trace with hash 941532, now seen corresponding path program 1 times [2019-01-20 10:10:17,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:17,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:17,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:17,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:17,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:17,377 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:10:17,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:17,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:17,378 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:17,378 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [31] [2019-01-20 10:10:17,380 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:17,380 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:17,386 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:17,386 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:17,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:17,386 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:17,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:17,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 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:10:17,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:17,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:17,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:17,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:17,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:17,435 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 27 treesize of output 33 [2019-01-20 10:10:17,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,444 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 29 treesize of output 43 [2019-01-20 10:10:17,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,451 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 31 treesize of output 57 [2019-01-20 10:10:17,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,461 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:17,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:17,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:17,493 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,533 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,571 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,597 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,617 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:17,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:17,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:17,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:17,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:17,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:17,903 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,930 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,961 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:17,988 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,015 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:18,065 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:18,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:10:18,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,331 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:18,332 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:18,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:18,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-20 10:10:18,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:18,792 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:18,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-01-20 10:10:18,816 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:10:18,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:18,839 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:10:18,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:18,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:18,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:18,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:18,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:18,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:18,859 INFO L87 Difference]: Start difference. First operand 34 states and 121 transitions. Second operand 8 states. [2019-01-20 10:10:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:19,402 INFO L93 Difference]: Finished difference Result 79 states and 193 transitions. [2019-01-20 10:10:19,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:19,403 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:19,405 INFO L225 Difference]: With dead ends: 79 [2019-01-20 10:10:19,405 INFO L226 Difference]: Without dead ends: 77 [2019-01-20 10:10:19,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 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:10:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-20 10:10:19,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 41. [2019-01-20 10:10:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:10:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-20 10:10:19,414 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-01-20 10:10:19,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:19,415 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-20 10:10:19,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-20 10:10:19,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:19,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:19,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:19,416 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:19,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:19,416 INFO L82 PathProgramCache]: Analyzing trace with hash 941160, now seen corresponding path program 1 times [2019-01-20 10:10:19,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:19,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:19,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:19,556 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:10:19,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:19,556 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:19,556 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:19,556 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [31] [2019-01-20 10:10:19,558 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:19,558 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:19,563 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:19,563 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:19,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:19,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:19,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:19,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:10:19,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:19,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:19,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:19,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:19,610 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 27 treesize of output 33 [2019-01-20 10:10:19,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-20 10:10:19,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,627 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 31 treesize of output 57 [2019-01-20 10:10:19,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:19,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:19,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:19,681 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,730 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,767 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,801 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,821 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,837 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,854 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:19,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:19,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:20,079 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-01-20 10:10:20,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:20,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:20,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,189 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:20,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:20,264 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,290 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,316 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,341 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,367 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:20,417 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:20,753 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-01-20 10:10:20,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:10:20,768 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,816 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:20,817 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:20,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:20,852 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:20,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-20 10:10:20,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:20,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:20,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-20 10:10:20,927 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:10:20,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:20,957 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:10:20,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:20,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:20,976 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:20,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:20,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:20,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:20,977 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-01-20 10:10:21,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:21,419 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-01-20 10:10:21,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:21,420 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:21,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:21,421 INFO L225 Difference]: With dead ends: 74 [2019-01-20 10:10:21,421 INFO L226 Difference]: Without dead ends: 73 [2019-01-20 10:10:21,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-20 10:10:21,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2019-01-20 10:10:21,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:10:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 150 transitions. [2019-01-20 10:10:21,431 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 150 transitions. Word has length 4 [2019-01-20 10:10:21,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:21,431 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 150 transitions. [2019-01-20 10:10:21,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:21,431 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 150 transitions. [2019-01-20 10:10:21,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:21,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:21,432 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:21,432 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:21,432 INFO L82 PathProgramCache]: Analyzing trace with hash 941656, now seen corresponding path program 1 times [2019-01-20 10:10:21,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:21,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:21,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:21,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:21,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:21,516 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:10:21,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:21,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:21,517 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:21,517 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [31] [2019-01-20 10:10:21,519 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:21,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:21,523 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:21,524 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:21,524 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:21,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:21,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 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:10:21,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:21,533 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:21,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:21,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:21,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:21,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:21,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,746 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:21,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:21,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:21,839 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:21,883 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:21,968 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,051 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,079 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:22,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:10:22,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-20 10:10:22,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:22,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:22,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:22,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:22,193 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,243 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,274 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,297 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,316 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,330 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,345 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:22,450 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:22,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:10:22,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,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:22,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:22,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:22,727 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:22,727 INFO L303 Elim1Store]: Index analysis took 126 ms [2019-01-20 10:10:22,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-20 10:10:22,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:22,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:22,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-20 10:10:22,816 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:10:22,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:22,861 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:10:22,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:22,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:22,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:22,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:22,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:22,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:22,882 INFO L87 Difference]: Start difference. First operand 41 states and 150 transitions. Second operand 8 states. [2019-01-20 10:10:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:23,377 INFO L93 Difference]: Finished difference Result 74 states and 192 transitions. [2019-01-20 10:10:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:23,377 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:23,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:23,378 INFO L225 Difference]: With dead ends: 74 [2019-01-20 10:10:23,378 INFO L226 Difference]: Without dead ends: 72 [2019-01-20 10:10:23,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:10:23,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-20 10:10:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2019-01-20 10:10:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-20 10:10:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 149 transitions. [2019-01-20 10:10:23,387 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 149 transitions. Word has length 4 [2019-01-20 10:10:23,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:23,387 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 149 transitions. [2019-01-20 10:10:23,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:23,387 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 149 transitions. [2019-01-20 10:10:23,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:23,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:23,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:23,388 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:23,389 INFO L82 PathProgramCache]: Analyzing trace with hash 941718, now seen corresponding path program 1 times [2019-01-20 10:10:23,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:23,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:23,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:23,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:23,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:23,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:23,512 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:10:23,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:23,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:23,513 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:23,513 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [31] [2019-01-20 10:10:23,514 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:23,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:23,519 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:23,519 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:23,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:23,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:23,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:23,520 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:10:23,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:23,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:23,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:23,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:23,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:10:23,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-20 10:10:23,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,604 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 31 treesize of output 57 [2019-01-20 10:10:23,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:23,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:23,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:23,681 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:23,722 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:23,756 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:23,782 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:23,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:23,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:23,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:23,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:23,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:23,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:23,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:24,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,029 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:24,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:24,121 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,145 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,171 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,197 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,223 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:24,271 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:24,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-01-20 10:10:24,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:24,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-20 10:10:24,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:150 [2019-01-20 10:10:24,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,537 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:24,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 97 [2019-01-20 10:10:24,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:24,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:24,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 142 [2019-01-20 10:10:24,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 32 xjuncts. [2019-01-20 10:10:25,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-01-20 10:10:25,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-01-20 10:10:26,170 WARN L181 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-01-20 10:10:26,171 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:10:26,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:26,204 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:10:26,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:26,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:10:26,224 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:26,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:26,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:26,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:26,225 INFO L87 Difference]: Start difference. First operand 40 states and 149 transitions. Second operand 8 states. [2019-01-20 10:10:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:33,374 INFO L93 Difference]: Finished difference Result 79 states and 233 transitions. [2019-01-20 10:10:33,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:10:33,376 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:33,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:33,378 INFO L225 Difference]: With dead ends: 79 [2019-01-20 10:10:33,378 INFO L226 Difference]: Without dead ends: 71 [2019-01-20 10:10:33,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:33,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-20 10:10:33,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 41. [2019-01-20 10:10:33,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:10:33,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 177 transitions. [2019-01-20 10:10:33,389 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 177 transitions. Word has length 4 [2019-01-20 10:10:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:33,389 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 177 transitions. [2019-01-20 10:10:33,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 177 transitions. [2019-01-20 10:10:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:33,390 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:33,390 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:33,390 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:33,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:33,391 INFO L82 PathProgramCache]: Analyzing trace with hash 930312, now seen corresponding path program 1 times [2019-01-20 10:10:33,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:33,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:33,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:33,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:33,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-20 10:10:33,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-20 10:10:33,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-20 10:10:33,610 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-20 10:10:33,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-20 10:10:33,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-20 10:10:33,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:10:33,611 INFO L87 Difference]: Start difference. First operand 41 states and 177 transitions. Second operand 4 states. [2019-01-20 10:10:34,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:34,158 INFO L93 Difference]: Finished difference Result 53 states and 195 transitions. [2019-01-20 10:10:34,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-20 10:10:34,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-20 10:10:34,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:34,159 INFO L225 Difference]: With dead ends: 53 [2019-01-20 10:10:34,159 INFO L226 Difference]: Without dead ends: 52 [2019-01-20 10:10:34,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-20 10:10:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-20 10:10:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2019-01-20 10:10:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-20 10:10:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 186 transitions. [2019-01-20 10:10:34,171 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 186 transitions. Word has length 4 [2019-01-20 10:10:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:34,172 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 186 transitions. [2019-01-20 10:10:34,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-20 10:10:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 186 transitions. [2019-01-20 10:10:34,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:34,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:34,173 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:34,173 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:34,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:34,173 INFO L82 PathProgramCache]: Analyzing trace with hash 929876, now seen corresponding path program 1 times [2019-01-20 10:10:34,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:34,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:34,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:34,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:34,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:34,412 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-20 10:10:34,624 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:10:34,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:34,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:34,625 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:34,625 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [31] [2019-01-20 10:10:34,626 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:34,626 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:34,630 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:34,631 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:34,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:34,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:34,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:34,631 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:10:34,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:34,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:34,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:34,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:34,809 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-20 10:10:34,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:34,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:34,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:34,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:34,990 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:35,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:35,069 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,096 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,125 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,153 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:35,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:10:35,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-20 10:10:35,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:35,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10: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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:35,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:35,241 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,280 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,311 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,334 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,353 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,368 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,383 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:35,433 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:35,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:35,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,523 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:35,523 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:35,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:35,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 103 [2019-01-20 10:10:35,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:35,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:35,603 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-01-20 10:10:35,619 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:10:35,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:35,632 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:10:35,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:35,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:10:35,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:35,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:35,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:35,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:35,653 INFO L87 Difference]: Start difference. First operand 43 states and 186 transitions. Second operand 8 states. [2019-01-20 10:10:36,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:36,159 INFO L93 Difference]: Finished difference Result 87 states and 278 transitions. [2019-01-20 10:10:36,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:36,160 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:36,161 INFO L225 Difference]: With dead ends: 87 [2019-01-20 10:10:36,161 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:10:36,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:10:36,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 41. [2019-01-20 10:10:36,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-20 10:10:36,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 149 transitions. [2019-01-20 10:10:36,171 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 149 transitions. Word has length 4 [2019-01-20 10:10:36,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:36,171 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 149 transitions. [2019-01-20 10:10:36,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:36,172 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 149 transitions. [2019-01-20 10:10:36,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:36,172 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:36,172 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:36,173 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:36,173 INFO L82 PathProgramCache]: Analyzing trace with hash 945688, now seen corresponding path program 1 times [2019-01-20 10:10:36,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:36,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:36,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:36,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:36,174 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:36,238 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:10:36,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:36,239 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:36,239 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:36,239 INFO L207 CegarAbsIntRunner]: [0], [22], [32], [33] [2019-01-20 10:10:36,240 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:36,240 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:36,245 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:36,246 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:10:36,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:36,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:36,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:36,246 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:10:36,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:36,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:36,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:36,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:36,304 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 27 treesize of output 33 [2019-01-20 10:10:36,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,309 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 29 treesize of output 43 [2019-01-20 10:10:36,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,316 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 31 treesize of output 57 [2019-01-20 10:10:36,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,326 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:36,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:36,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:36,439 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,477 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,511 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,537 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,556 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,573 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:36,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:36,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:36,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:36,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:36,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:36,845 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,870 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,894 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,920 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,947 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:36,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:36,997 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:39,031 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-01-20 10:10:39,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:39,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:39,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:39,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:39,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:39,208 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:10:39,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:39,252 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:10:39,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:39,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:10:39,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:39,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:10:39,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:10:39,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:10:39,273 INFO L87 Difference]: Start difference. First operand 41 states and 149 transitions. Second operand 6 states. [2019-01-20 10:10:39,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:39,622 INFO L93 Difference]: Finished difference Result 64 states and 185 transitions. [2019-01-20 10:10:39,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:10:39,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:10:39,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:39,629 INFO L225 Difference]: With dead ends: 64 [2019-01-20 10:10:39,629 INFO L226 Difference]: Without dead ends: 63 [2019-01-20 10:10:39,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-20 10:10:39,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-20 10:10:39,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2019-01-20 10:10:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-20 10:10:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 157 transitions. [2019-01-20 10:10:39,639 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 157 transitions. Word has length 4 [2019-01-20 10:10:39,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:39,640 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 157 transitions. [2019-01-20 10:10:39,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:10:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 157 transitions. [2019-01-20 10:10:39,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:39,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:39,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:39,641 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:39,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:39,641 INFO L82 PathProgramCache]: Analyzing trace with hash 945004, now seen corresponding path program 1 times [2019-01-20 10:10:39,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:39,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:39,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:39,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:39,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:40,020 WARN L181 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-01-20 10:10:40,039 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:10:40,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:40,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:40,039 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:40,039 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [31] [2019-01-20 10:10:40,040 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:40,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:40,045 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:40,045 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:40,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:40,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:40,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:40,046 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:10:40,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:40,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:40,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:40,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:40,088 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 27 treesize of output 33 [2019-01-20 10:10:40,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,094 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 29 treesize of output 43 [2019-01-20 10:10:40,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:40,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,110 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:40,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:40,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:40,133 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,178 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,211 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,236 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,258 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,276 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:40,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:40,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:40,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,492 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:40,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:40,564 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,596 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,622 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,648 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,676 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,733 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:40,733 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:40,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:40,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,837 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:40,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:40,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:40,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:10:40,873 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:40,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:40,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-01-20 10:10:40,941 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:10:40,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:40,958 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:10:40,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:40,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:10:40,977 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:40,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:40,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:40,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:10:40,978 INFO L87 Difference]: Start difference. First operand 42 states and 157 transitions. Second operand 8 states. [2019-01-20 10:10:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:41,909 INFO L93 Difference]: Finished difference Result 98 states and 268 transitions. [2019-01-20 10:10:41,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:10:41,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:41,911 INFO L225 Difference]: With dead ends: 98 [2019-01-20 10:10:41,911 INFO L226 Difference]: Without dead ends: 97 [2019-01-20 10:10:41,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-20 10:10:41,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-20 10:10:41,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 47. [2019-01-20 10:10:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-20 10:10:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 197 transitions. [2019-01-20 10:10:41,924 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 197 transitions. Word has length 4 [2019-01-20 10:10:41,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:41,925 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 197 transitions. [2019-01-20 10:10:41,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 197 transitions. [2019-01-20 10:10:41,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:41,925 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:41,925 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:41,926 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:41,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:41,926 INFO L82 PathProgramCache]: Analyzing trace with hash 945500, now seen corresponding path program 1 times [2019-01-20 10:10:41,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:41,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:41,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:41,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:41,927 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:42,010 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:10:42,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:42,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:42,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:42,011 INFO L207 CegarAbsIntRunner]: [0], [22], [26], [31] [2019-01-20 10:10:42,012 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:42,013 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:42,017 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:42,017 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:42,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:42,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:42,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:42,018 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:10:42,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:42,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:42,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:42,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:42,074 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 27 treesize of output 33 [2019-01-20 10:10:42,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-20 10:10:42,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:42,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,156 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:42,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:42,307 INFO L303 Elim1Store]: Index analysis took 139 ms [2019-01-20 10:10:42,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:42,309 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,537 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,570 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,593 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,630 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:42,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:42,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:42,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,827 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:42,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:42,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:42,900 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,926 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,951 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:42,977 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:43,004 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:43,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:43,054 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:43,493 WARN L181 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-01-20 10:10:43,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:43,538 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:43,539 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:44,077 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:44,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:44,309 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-20 10:10:44,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:44,516 INFO L303 Elim1Store]: Index analysis took 201 ms [2019-01-20 10:10:44,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 111 [2019-01-20 10:10:44,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:45,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:45,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-01-20 10:10:45,350 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-20 10:10:45,352 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:10:45,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:45,767 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:10:45,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:45,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:45,785 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:45,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:45,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:45,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:45,786 INFO L87 Difference]: Start difference. First operand 47 states and 197 transitions. Second operand 8 states. [2019-01-20 10:10:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:46,231 INFO L93 Difference]: Finished difference Result 91 states and 282 transitions. [2019-01-20 10:10:46,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:46,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:46,233 INFO L225 Difference]: With dead ends: 91 [2019-01-20 10:10:46,233 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:10:46,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:46,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:10:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 56. [2019-01-20 10:10:46,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-20 10:10:46,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 243 transitions. [2019-01-20 10:10:46,249 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 243 transitions. Word has length 4 [2019-01-20 10:10:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:46,249 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 243 transitions. [2019-01-20 10:10:46,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:46,250 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 243 transitions. [2019-01-20 10:10:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:46,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:46,251 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:46,251 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:46,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:46,251 INFO L82 PathProgramCache]: Analyzing trace with hash 933968, now seen corresponding path program 1 times [2019-01-20 10:10:46,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:46,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:46,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:46,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:46,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:46,332 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:10:46,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:46,332 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:46,332 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:46,333 INFO L207 CegarAbsIntRunner]: [0], [10], [26], [31] [2019-01-20 10:10:46,333 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:46,334 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:46,340 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:46,340 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:46,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:46,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:46,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:46,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 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:10:46,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:46,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:46,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:46,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:46,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:46,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:46,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,544 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:46,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:46,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:46,620 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:46,649 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:46,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:46,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:46,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:46,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:46,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:10:46,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, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-20 10:10:46,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:10:46,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:46,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:46,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:46,792 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:46,830 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:46,861 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:46,885 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:46,901 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:46,917 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:46,932 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:46,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:46,982 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:47,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:10:47,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:47,099 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:47,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:10:47,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,130 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:47,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 112 [2019-01-20 10:10:47,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:47,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:47,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:61 [2019-01-20 10:10:47,202 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:10:47,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:10:47,228 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:10:47,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:10:47,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:10:47,246 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:10:47,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:10:47,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:10:47,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:10:47,247 INFO L87 Difference]: Start difference. First operand 56 states and 243 transitions. Second operand 8 states. [2019-01-20 10:10:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:10:47,636 INFO L93 Difference]: Finished difference Result 92 states and 291 transitions. [2019-01-20 10:10:47,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:10:47,637 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:10:47,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:10:47,638 INFO L225 Difference]: With dead ends: 92 [2019-01-20 10:10:47,638 INFO L226 Difference]: Without dead ends: 90 [2019-01-20 10:10:47,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:10:47,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-20 10:10:47,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 59. [2019-01-20 10:10:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-20 10:10:47,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 254 transitions. [2019-01-20 10:10:47,653 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 254 transitions. Word has length 4 [2019-01-20 10:10:47,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:10:47,654 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 254 transitions. [2019-01-20 10:10:47,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:10:47,654 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 254 transitions. [2019-01-20 10:10:47,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:10:47,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:10:47,655 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:10:47,655 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:10:47,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:47,656 INFO L82 PathProgramCache]: Analyzing trace with hash 949406, now seen corresponding path program 1 times [2019-01-20 10:10:47,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:10:47,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:47,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:47,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:10:47,657 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:10:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:10:47,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:47,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:10:47,830 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:10:47,830 INFO L207 CegarAbsIntRunner]: [0], [26], [28], [31] [2019-01-20 10:10:47,833 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:10:47,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:10:47,837 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:10:47,837 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:10:47,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:10:47,837 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:10:47,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:10:47,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 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:10:47,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:10:47,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:10:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:10:47,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:10:47,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:10:47,929 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 27 treesize of output 33 [2019-01-20 10:10:47,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,937 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 29 treesize of output 43 [2019-01-20 10:10:47,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,948 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 31 treesize of output 57 [2019-01-20 10:10:47,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,955 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:10:47,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:47,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:10:47,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:10:47,982 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,023 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,057 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,081 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,118 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,143 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,158 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:10:48,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:10:48,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:10:48,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:10:48,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:10:48,406 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,429 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,457 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,484 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,508 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:10:48,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:10:48,559 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-01-20 10:10:48,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 106 [2019-01-20 10:10:48,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:10:48,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-20 10:10:48,803 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:106, output treesize:150 [2019-01-20 10:10:48,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:48,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 88 treesize of output 142 [2019-01-20 10:10:48,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-20 10:10:49,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:10:49,858 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:10:49,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 97 [2019-01-20 10:10:49,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:10:50,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 36 dim-0 vars, and 7 xjuncts. [2019-01-20 10:10:50,120 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:172, output treesize:455 [2019-01-20 10:11:12,213 WARN L181 SmtUtils]: Spent 21.89 s on a formula simplification. DAG size of input: 264 DAG size of output: 121 [2019-01-20 10:11:12,214 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:11:12,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:12,253 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:11:12,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:12,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:11:12,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:12,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:12,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:12,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:11:12,274 INFO L87 Difference]: Start difference. First operand 59 states and 254 transitions. Second operand 8 states. [2019-01-20 10:11:18,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:18,488 INFO L93 Difference]: Finished difference Result 101 states and 344 transitions. [2019-01-20 10:11:18,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:18,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:11:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:18,490 INFO L225 Difference]: With dead ends: 101 [2019-01-20 10:11:18,490 INFO L226 Difference]: Without dead ends: 100 [2019-01-20 10:11:18,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 22.5s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:18,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-20 10:11:18,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 63. [2019-01-20 10:11:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-20 10:11:18,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 286 transitions. [2019-01-20 10:11:18,507 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 286 transitions. Word has length 4 [2019-01-20 10:11:18,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:18,508 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 286 transitions. [2019-01-20 10:11:18,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:11:18,508 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 286 transitions. [2019-01-20 10:11:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:11:18,509 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:18,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:11:18,509 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:18,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:18,509 INFO L82 PathProgramCache]: Analyzing trace with hash 951454, now seen corresponding path program 1 times [2019-01-20 10:11:18,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:18,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:18,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:18,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:18,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:18,584 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:11:18,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:18,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:18,584 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:11:18,584 INFO L207 CegarAbsIntRunner]: [0], [28], [32], [33] [2019-01-20 10:11:18,585 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:18,585 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:18,593 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:18,593 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:11:18,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:18,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:18,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:18,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 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:11:18,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:18,605 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:18,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:18,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-01-20 10:11:18,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,704 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-01-20 10:11:18,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-01-20 10:11:18,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,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, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-01-20 10:11:18,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:18,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-01-20 10:11:19,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:19,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:19,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:19,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:19,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:19,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:19,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:19,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:19,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:19,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:19,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-01-20 10:11:19,022 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,072 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,124 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,174 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,225 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:11:19,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, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:11:19,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-20 10:11:19,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:11:19,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:11:19,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:11:19,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-20 10:11:19,348 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,398 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,427 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,450 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,468 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,484 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,496 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:19,564 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 7 variables, input treesize:118, output treesize:120 [2019-01-20 10:11:19,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:19,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-01-20 10:11:19,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:19,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:19,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:130, output treesize:96 [2019-01-20 10:11:19,708 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:11:19,708 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:19,720 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:11:19,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:19,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:11:19,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:19,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:11:19,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:11:19,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:11:19,740 INFO L87 Difference]: Start difference. First operand 63 states and 286 transitions. Second operand 6 states. [2019-01-20 10:11:19,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:19,988 INFO L93 Difference]: Finished difference Result 86 states and 322 transitions. [2019-01-20 10:11:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:11:19,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:11:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:19,990 INFO L225 Difference]: With dead ends: 86 [2019-01-20 10:11:19,990 INFO L226 Difference]: Without dead ends: 85 [2019-01-20 10:11:19,990 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:11:19,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-20 10:11:20,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 64. [2019-01-20 10:11:20,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-20 10:11:20,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 294 transitions. [2019-01-20 10:11:20,008 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 294 transitions. Word has length 4 [2019-01-20 10:11:20,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:20,008 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 294 transitions. [2019-01-20 10:11:20,009 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:11:20,009 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 294 transitions. [2019-01-20 10:11:20,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:11:20,009 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:20,009 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:11:20,009 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:20,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:20,010 INFO L82 PathProgramCache]: Analyzing trace with hash 951266, now seen corresponding path program 2 times [2019-01-20 10:11:20,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:20,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:20,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:20,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:20,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-20 10:11:20,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:20,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:20,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-20 10:11:20,087 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:11:20,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:20,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:11:20,102 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-20 10:11:20,102 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-20 10:11:20,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-20 10:11:20,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-20 10:11:20,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:20,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:11:20,221 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 27 treesize of output 33 [2019-01-20 10:11:20,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,227 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 29 treesize of output 43 [2019-01-20 10:11:20,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,235 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 31 treesize of output 57 [2019-01-20 10:11:20,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,244 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:11:20,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:11:20,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-20 10:11:20,311 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,367 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,401 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,427 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,466 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:20,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-01-20 10:11:20,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-01-20 10:11:20,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-01-20 10:11:20,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,693 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-01-20 10:11:20,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-01-20 10:11:20,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:20,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-01-20 10:11:20,898 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:21,049 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:21,086 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:21,126 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:21,167 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:21,207 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:21,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:21,275 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-01-20 10:11:21,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 126 [2019-01-20 10:11:21,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:21,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:21,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-01-20 10:11:21,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:21,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 140 [2019-01-20 10:11:21,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:21,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:21,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:106, output treesize:76 [2019-01-20 10:11:21,511 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:11:21,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:21,528 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:11:21,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:21,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-20 10:11:21,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:21,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:21,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:21,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:11:21,547 INFO L87 Difference]: Start difference. First operand 64 states and 294 transitions. Second operand 8 states. [2019-01-20 10:11:22,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:22,167 INFO L93 Difference]: Finished difference Result 119 states and 384 transitions. [2019-01-20 10:11:22,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-20 10:11:22,168 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-20 10:11:22,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:22,169 INFO L225 Difference]: With dead ends: 119 [2019-01-20 10:11:22,170 INFO L226 Difference]: Without dead ends: 115 [2019-01-20 10:11:22,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-20 10:11:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 67. [2019-01-20 10:11:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-20 10:11:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 286 transitions. [2019-01-20 10:11:22,190 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 286 transitions. Word has length 4 [2019-01-20 10:11:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:22,190 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 286 transitions. [2019-01-20 10:11:22,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:11:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 286 transitions. [2019-01-20 10:11:22,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-20 10:11:22,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:22,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-20 10:11:22,192 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:22,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:22,192 INFO L82 PathProgramCache]: Analyzing trace with hash 938000, now seen corresponding path program 1 times [2019-01-20 10:11:22,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:22,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:22,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-20 10:11:22,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:22,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:22,380 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:11:22,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:22,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:22,381 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-20 10:11:22,381 INFO L207 CegarAbsIntRunner]: [0], [14], [32], [33] [2019-01-20 10:11:22,382 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:22,382 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:22,385 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:22,385 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 2. Performed 76 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:11:22,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:22,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:22,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:22,386 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:11:22,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:22,398 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:22,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:22,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:11:22,449 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 27 treesize of output 33 [2019-01-20 10:11:22,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,457 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 29 treesize of output 43 [2019-01-20 10:11:22,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,465 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 31 treesize of output 57 [2019-01-20 10:11:22,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:11:22,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,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, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:11:22,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:11:22,511 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,550 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,582 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,604 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,642 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:22,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:22,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:22,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,835 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:22,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:22,907 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:22,907 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,933 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,958 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:22,985 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,011 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:23,060 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:95, output treesize:96 [2019-01-20 10:11:23,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:23,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 97 [2019-01-20 10:11:23,109 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:23,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:23,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:23,191 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:11:23,192 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:23,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:11:23,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:23,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-20 10:11:23,220 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:23,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-20 10:11:23,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-20 10:11:23,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:11:23,221 INFO L87 Difference]: Start difference. First operand 67 states and 286 transitions. Second operand 6 states. [2019-01-20 10:11:23,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:23,533 INFO L93 Difference]: Finished difference Result 90 states and 322 transitions. [2019-01-20 10:11:23,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:11:23,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-20 10:11:23,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:23,537 INFO L225 Difference]: With dead ends: 90 [2019-01-20 10:11:23,537 INFO L226 Difference]: Without dead ends: 89 [2019-01-20 10:11:23,537 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:11:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-20 10:11:23,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 68. [2019-01-20 10:11:23,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-20 10:11:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 294 transitions. [2019-01-20 10:11:23,557 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 294 transitions. Word has length 4 [2019-01-20 10:11:23,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:23,557 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 294 transitions. [2019-01-20 10:11:23,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-20 10:11:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 294 transitions. [2019-01-20 10:11:23,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:23,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:23,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:23,558 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:23,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:23,559 INFO L82 PathProgramCache]: Analyzing trace with hash 29197230, now seen corresponding path program 1 times [2019-01-20 10:11:23,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:23,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:23,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:23,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:23,560 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:24,166 WARN L181 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2019-01-20 10:11:24,291 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:11:24,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:24,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:24,292 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:24,292 INFO L207 CegarAbsIntRunner]: [0], [18], [32], [34], [35] [2019-01-20 10:11:24,293 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:24,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:24,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:24,297 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-20 10:11:24,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:24,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:24,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:24,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 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:11:24,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:24,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:24,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:24,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 63 [2019-01-20 10:11:24,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 48 [2019-01-20 10:11:24,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 62 [2019-01-20 10:11:24,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 72 [2019-01-20 10:11:24,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2019-01-20 10:11:24,480 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,502 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,525 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,549 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:11:24,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:11:24,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2019-01-20 10:11:24,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2019-01-20 10:11:24,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-20 10:11:24,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 89 [2019-01-20 10:11:24,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 88 [2019-01-20 10:11:24,644 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,678 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,703 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,723 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,738 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,753 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,766 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:24,808 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:84, output treesize:88 [2019-01-20 10:11:24,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:24,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 83 [2019-01-20 10:11:24,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:24,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:24,882 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:93, output treesize:63 [2019-01-20 10:11:24,903 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:11:24,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:24,912 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:11:24,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:24,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 6 [2019-01-20 10:11:24,930 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:24,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-20 10:11:24,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-20 10:11:24,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-20 10:11:24,931 INFO L87 Difference]: Start difference. First operand 68 states and 294 transitions. Second operand 7 states. [2019-01-20 10:11:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:25,232 INFO L93 Difference]: Finished difference Result 77 states and 308 transitions. [2019-01-20 10:11:25,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-20 10:11:25,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-20 10:11:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:25,234 INFO L225 Difference]: With dead ends: 77 [2019-01-20 10:11:25,234 INFO L226 Difference]: Without dead ends: 76 [2019-01-20 10:11:25,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-20 10:11:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-20 10:11:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2019-01-20 10:11:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-20 10:11:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 301 transitions. [2019-01-20 10:11:25,250 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 301 transitions. Word has length 5 [2019-01-20 10:11:25,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:25,250 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 301 transitions. [2019-01-20 10:11:25,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-20 10:11:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 301 transitions. [2019-01-20 10:11:25,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:25,250 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:25,250 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:25,251 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:25,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:25,251 INFO L82 PathProgramCache]: Analyzing trace with hash 29172180, now seen corresponding path program 1 times [2019-01-20 10:11:25,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:25,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:25,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:25,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:25,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:25,335 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:11:25,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:25,336 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:25,336 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:25,336 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [32], [33] [2019-01-20 10:11:25,339 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:25,339 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:25,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:25,343 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:25,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:25,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:25,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 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:11:25,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:25,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:25,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:25,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:11:25,477 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 27 treesize of output 33 [2019-01-20 10:11:25,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,484 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 29 treesize of output 43 [2019-01-20 10:11:25,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,493 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 31 treesize of output 57 [2019-01-20 10:11:25,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:11:25,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:11:25,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:11:25,521 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,562 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,593 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,618 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,636 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,652 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,668 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:25,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:25,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,786 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:25,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,843 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:25,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:25,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:25,915 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,941 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,965 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:25,991 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,017 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,065 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:26,065 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-01-20 10:11:26,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:11:26,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,151 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:11:26,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:26,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:26,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:11:26,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:26,265 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:26,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-01-20 10:11:26,285 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:11:26,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:26,306 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:11:26,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:26,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:11:26,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:26,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:26,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:26,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:26,325 INFO L87 Difference]: Start difference. First operand 69 states and 301 transitions. Second operand 8 states. [2019-01-20 10:11:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:26,775 INFO L93 Difference]: Finished difference Result 102 states and 353 transitions. [2019-01-20 10:11:26,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:11:26,776 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:11:26,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:26,777 INFO L225 Difference]: With dead ends: 102 [2019-01-20 10:11:26,777 INFO L226 Difference]: Without dead ends: 101 [2019-01-20 10:11:26,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:11:26,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-20 10:11:26,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 71. [2019-01-20 10:11:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-20 10:11:26,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 317 transitions. [2019-01-20 10:11:26,801 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 317 transitions. Word has length 5 [2019-01-20 10:11:26,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:26,802 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 317 transitions. [2019-01-20 10:11:26,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:11:26,802 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 317 transitions. [2019-01-20 10:11:26,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:26,802 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:26,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:26,803 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:26,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:26,803 INFO L82 PathProgramCache]: Analyzing trace with hash 29171496, now seen corresponding path program 1 times [2019-01-20 10:11:26,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:26,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:26,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:26,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:26,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:27,015 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-20 10:11:27,053 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:11:27,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:27,053 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:27,053 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:27,054 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [31] [2019-01-20 10:11:27,055 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:27,055 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:27,057 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:27,057 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:11:27,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:27,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:27,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:27,058 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:11:27,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:27,067 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:27,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:27,079 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:27,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:27,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,155 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:27,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,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, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:27,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,258 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:27,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:27,331 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,356 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,382 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,415 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:11:27,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:11:27,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-20 10:11:27,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:11:27,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:11:27,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:11:27,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:11:27,536 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,574 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,602 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,625 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,642 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,658 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,673 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:27,721 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-01-20 10:11:27,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:11:27,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,808 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:11:27,809 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:27,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 113 [2019-01-20 10:11:27,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,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:11:27,890 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:11:27,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,922 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:27,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:27,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 122 [2019-01-20 10:11:27,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:27,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:27,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:11:27,995 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:11:27,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:28,020 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:11:28,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:28,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:11:28,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:28,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:28,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:28,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:11:28,039 INFO L87 Difference]: Start difference. First operand 71 states and 317 transitions. Second operand 10 states. [2019-01-20 10:11:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:29,374 INFO L93 Difference]: Finished difference Result 147 states and 540 transitions. [2019-01-20 10:11:29,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-20 10:11:29,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:11:29,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:29,376 INFO L225 Difference]: With dead ends: 147 [2019-01-20 10:11:29,377 INFO L226 Difference]: Without dead ends: 146 [2019-01-20 10:11:29,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:11:29,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-20 10:11:29,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 89. [2019-01-20 10:11:29,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-20 10:11:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 464 transitions. [2019-01-20 10:11:29,404 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 464 transitions. Word has length 5 [2019-01-20 10:11:29,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:29,404 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 464 transitions. [2019-01-20 10:11:29,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:29,404 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 464 transitions. [2019-01-20 10:11:29,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:29,405 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:29,405 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:29,405 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:29,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:29,406 INFO L82 PathProgramCache]: Analyzing trace with hash 29187556, now seen corresponding path program 1 times [2019-01-20 10:11:29,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:29,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:29,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:29,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:29,407 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:29,541 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:11:29,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:29,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:29,541 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:29,541 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [32], [33] [2019-01-20 10:11:29,542 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:29,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:29,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:29,546 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:29,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:29,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:29,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:29,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:11:29,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:29,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:29,560 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:29,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:11:29,589 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:11:29,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,598 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 29 treesize of output 43 [2019-01-20 10:11:29,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,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 31 treesize of output 57 [2019-01-20 10:11:29,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,614 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:11:29,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:11:29,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:11:29,636 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,676 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,732 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,767 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,782 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:29,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:29,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:29,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:29,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:29,954 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:30,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:30,024 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,049 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,074 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,099 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,124 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:30,178 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 6 variables, input treesize:95, output treesize:96 [2019-01-20 10:11:30,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:11:30,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,260 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:11:30,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:30,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:30,414 INFO L303 Elim1Store]: Index analysis took 132 ms [2019-01-20 10:11:30,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-20 10:11:30,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:30,460 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:30,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-01-20 10:11:30,483 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:11:30,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:30,503 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:11:30,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:30,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:11:30,521 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:30,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:30,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:30,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:30,522 INFO L87 Difference]: Start difference. First operand 89 states and 464 transitions. Second operand 8 states. [2019-01-20 10:11:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:30,907 INFO L93 Difference]: Finished difference Result 128 states and 531 transitions. [2019-01-20 10:11:30,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-20 10:11:30,907 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-20 10:11:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:30,909 INFO L225 Difference]: With dead ends: 128 [2019-01-20 10:11:30,909 INFO L226 Difference]: Without dead ends: 127 [2019-01-20 10:11:30,910 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:11:30,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-20 10:11:30,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 92. [2019-01-20 10:11:30,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-20 10:11:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 488 transitions. [2019-01-20 10:11:30,940 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 488 transitions. Word has length 5 [2019-01-20 10:11:30,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:30,940 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 488 transitions. [2019-01-20 10:11:30,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-20 10:11:30,940 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 488 transitions. [2019-01-20 10:11:30,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:30,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:30,941 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:30,941 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:30,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:30,941 INFO L82 PathProgramCache]: Analyzing trace with hash 29187368, now seen corresponding path program 1 times [2019-01-20 10:11:30,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:30,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:30,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:30,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:30,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:31,133 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-01-20 10:11:31,167 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:11:31,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:31,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:31,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:31,167 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [26], [31] [2019-01-20 10:11:31,169 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:31,169 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:31,171 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:31,171 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:11:31,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:31,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:31,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:31,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 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:11:31,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:31,189 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:31,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:31,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:11:31,218 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 27 treesize of output 33 [2019-01-20 10:11:31,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,223 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 29 treesize of output 43 [2019-01-20 10:11:31,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,230 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 31 treesize of output 57 [2019-01-20 10:11:31,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:11:31,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:11:31,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:11:31,264 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,303 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,335 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,360 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,378 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,394 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:31,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:31,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:31,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,580 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:31,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:31,648 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,673 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,698 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,723 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,748 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:31,794 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-01-20 10:11:31,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:11:31,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:31,951 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:11:31,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:31,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:31,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 105 [2019-01-20 10:11:31,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,035 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:11:32,035 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-20 10:11:32,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,072 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:32,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:32,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 118 [2019-01-20 10:11:32,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:32,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:32,121 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-20 10:11:32,145 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:11:32,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:32,194 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:11:32,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:32,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:11:32,213 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:32,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:32,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:32,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:11:32,214 INFO L87 Difference]: Start difference. First operand 92 states and 488 transitions. Second operand 10 states. [2019-01-20 10:11:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:34,119 INFO L93 Difference]: Finished difference Result 146 states and 591 transitions. [2019-01-20 10:11:34,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:34,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:11:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:34,122 INFO L225 Difference]: With dead ends: 146 [2019-01-20 10:11:34,122 INFO L226 Difference]: Without dead ends: 144 [2019-01-20 10:11:34,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-20 10:11:34,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-20 10:11:34,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 98. [2019-01-20 10:11:34,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-20 10:11:34,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 536 transitions. [2019-01-20 10:11:34,166 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 536 transitions. Word has length 5 [2019-01-20 10:11:34,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:34,166 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 536 transitions. [2019-01-20 10:11:34,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:34,167 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 536 transitions. [2019-01-20 10:11:34,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:34,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:34,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:34,168 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash 29175836, now seen corresponding path program 1 times [2019-01-20 10:11:34,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:34,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:34,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:34,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:34,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:34,291 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:11:34,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:34,291 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:34,291 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:34,291 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [26], [31] [2019-01-20 10:11:34,293 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:34,293 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:34,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:34,296 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:11:34,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:34,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:34,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:34,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 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:11:34,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:34,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:34,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:34,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:34,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:11:34,341 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 27 treesize of output 33 [2019-01-20 10:11:34,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,345 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 29 treesize of output 43 [2019-01-20 10:11:34,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,352 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 31 treesize of output 57 [2019-01-20 10:11:34,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:11:34,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:11:34,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:11:34,381 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,420 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,452 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,477 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,497 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,514 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,529 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:34,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:34,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:34,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:34,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:34,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:34,802 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,827 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,852 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,877 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,902 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:34,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:34,949 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-01-20 10:11:35,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 91 [2019-01-20 10:11:35,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,053 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:11:35,053 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-20 10:11:35,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,088 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:35,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 106 [2019-01-20 10:11:35,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,136 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:11:35,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-20 10:11:35,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:35,174 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:35,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 108 [2019-01-20 10:11:35,176 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:35,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:35,220 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-01-20 10:11:35,244 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:11:35,244 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:35,296 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:11:35,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:35,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-20 10:11:35,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:35,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:35,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:35,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-20 10:11:35,315 INFO L87 Difference]: Start difference. First operand 98 states and 536 transitions. Second operand 10 states. [2019-01-20 10:11:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:36,263 INFO L93 Difference]: Finished difference Result 140 states and 582 transitions. [2019-01-20 10:11:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-20 10:11:36,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:11:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:36,265 INFO L225 Difference]: With dead ends: 140 [2019-01-20 10:11:36,265 INFO L226 Difference]: Without dead ends: 138 [2019-01-20 10:11:36,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=196, Unknown=0, NotChecked=0, Total=306 [2019-01-20 10:11:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-20 10:11:36,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2019-01-20 10:11:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-20 10:11:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 486 transitions. [2019-01-20 10:11:36,297 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 486 transitions. Word has length 5 [2019-01-20 10:11:36,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:36,297 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 486 transitions. [2019-01-20 10:11:36,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 486 transitions. [2019-01-20 10:11:36,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:36,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:36,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:36,298 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:36,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:36,298 INFO L82 PathProgramCache]: Analyzing trace with hash 29191274, now seen corresponding path program 1 times [2019-01-20 10:11:36,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:36,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:36,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:36,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:36,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:36,424 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:11:36,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:36,424 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:36,424 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:36,425 INFO L207 CegarAbsIntRunner]: [0], [18], [26], [28], [31] [2019-01-20 10:11:36,426 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:36,426 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:36,427 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:36,428 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2019-01-20 10:11:36,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:36,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:36,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:36,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:11:36,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:36,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:36,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:36,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2019-01-20 10:11:36,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-20 10:11:36,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-20 10:11:36,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,601 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-20 10:11:36,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:36,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 61 [2019-01-20 10:11:36,671 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:36,696 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:36,721 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:36,746 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:36,771 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:36,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:11:36,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:11:36,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-20 10:11:36,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:11:36,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:11:36,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:11:36,839 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 96 [2019-01-20 10:11:36,840 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:36,886 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:36,914 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:36,936 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:36,954 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:36,968 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:36,982 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:37,028 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 5 variables, input treesize:95, output treesize:96 [2019-01-20 10:11:37,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,071 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 100 [2019-01-20 10:11:37,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-20 10:11:37,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-20 10:11:37,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:106, output treesize:150 [2019-01-20 10:11:37,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,278 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:37,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 112 [2019-01-20 10:11:37,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:37,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,392 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:37,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 131 [2019-01-20 10:11:37,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-20 10:11:37,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 3 xjuncts. [2019-01-20 10:11:37,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:172, output treesize:185 [2019-01-20 10:11:37,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:37,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 136 [2019-01-20 10:11:37,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-20 10:11:38,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:38,235 INFO L683 Elim1Store]: detected equality via solver [2019-01-20 10:11:38,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 105 [2019-01-20 10:11:38,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:38,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 6 xjuncts. [2019-01-20 10:11:38,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:152, output treesize:346 [2019-01-20 10:11:42,890 WARN L181 SmtUtils]: Spent 4.37 s on a formula simplification. DAG size of input: 211 DAG size of output: 109 [2019-01-20 10:11:42,892 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:11:42,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:42,989 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:11:43,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:43,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-20 10:11:43,009 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:43,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-20 10:11:43,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-20 10:11:43,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-20 10:11:43,009 INFO L87 Difference]: Start difference. First operand 92 states and 486 transitions. Second operand 10 states. [2019-01-20 10:11:47,394 WARN L181 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 122 DAG size of output: 89 [2019-01-20 10:11:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-20 10:11:49,169 INFO L93 Difference]: Finished difference Result 155 states and 683 transitions. [2019-01-20 10:11:49,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-20 10:11:49,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-20 10:11:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-20 10:11:49,171 INFO L225 Difference]: With dead ends: 155 [2019-01-20 10:11:49,171 INFO L226 Difference]: Without dead ends: 154 [2019-01-20 10:11:49,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-20 10:11:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-20 10:11:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 98. [2019-01-20 10:11:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-20 10:11:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 534 transitions. [2019-01-20 10:11:49,208 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 534 transitions. Word has length 5 [2019-01-20 10:11:49,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-20 10:11:49,209 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 534 transitions. [2019-01-20 10:11:49,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-20 10:11:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 534 transitions. [2019-01-20 10:11:49,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-20 10:11:49,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-20 10:11:49,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-20 10:11:49,210 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr2ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr6ASSERT_VIOLATIONASSERT]=== [2019-01-20 10:11:49,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:49,210 INFO L82 PathProgramCache]: Analyzing trace with hash 29193322, now seen corresponding path program 1 times [2019-01-20 10:11:49,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-20 10:11:49,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:49,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:49,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-20 10:11:49,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-20 10:11:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:49,300 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:11:49,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:49,300 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-20 10:11:49,301 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-20 10:11:49,301 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [32], [33] [2019-01-20 10:11:49,302 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-20 10:11:49,302 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-20 10:11:49,304 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-20 10:11:49,305 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 78 root evaluator evaluations with a maximum evaluation depth of 2. Performed 78 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-20 10:11:49,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-20 10:11:49,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-20 10:11:49,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-20 10:11:49,305 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:11:49,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-20 10:11:49,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-20 10:11:49,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-20 10:11:49,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-20 10:11:49,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 91 [2019-01-20 10:11:49,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 84 [2019-01-20 10:11:49,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 86 [2019-01-20 10:11:49,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 91 [2019-01-20 10:11:49,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,762 INFO L303 Elim1Store]: Index analysis took 191 ms [2019-01-20 10:11:49,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 105 [2019-01-20 10:11:49,937 WARN L181 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 47 [2019-01-20 10:11:49,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:49,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 85 [2019-01-20 10:11:49,951 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:49,994 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,034 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,113 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,154 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2019-01-20 10:11:50,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, 11 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 33 [2019-01-20 10:11:50,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 15 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2019-01-20 10:11:50,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 18 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-20 10:11:50,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 75 [2019-01-20 10:11:50,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 21 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 97 [2019-01-20 10:11:50,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 120 [2019-01-20 10:11:50,223 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,271 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,300 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,322 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,339 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,354 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,367 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,432 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:50,433 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:118, output treesize:120 [2019-01-20 10:11:50,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 120 [2019-01-20 10:11:50,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:50,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:130, output treesize:96 [2019-01-20 10:11:50,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-20 10:11:50,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 24 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 142 [2019-01-20 10:11:50,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-20 10:11:50,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-01-20 10:11:50,623 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:108, output treesize:78 [2019-01-20 10:11:50,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:11:50,652 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-20 10:11:50,675 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:11:50,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-20 10:11:50,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-20 10:11:50,694 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-20 10:11:50,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-20 10:11:50,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-20 10:11:50,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-20 10:11:50,695 INFO L87 Difference]: Start difference. First operand 98 states and 534 transitions. Second operand 8 states. [2019-01-20 10:11:51,217 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-01-20 10:11:51,219 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:652) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:256) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2019-01-20 10:11:51,223 INFO L168 Benchmark]: Toolchain (without parser) took 105609.85 ms. Allocated memory was 140.0 MB in the beginning and 448.8 MB in the end (delta: 308.8 MB). Free memory was 106.4 MB in the beginning and 195.6 MB in the end (delta: -89.3 MB). Peak memory consumption was 219.6 MB. Max. memory is 7.1 GB. [2019-01-20 10:11:51,224 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 140.0 MB. Free memory is still 107.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-20 10:11:51,224 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.45 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 103.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-01-20 10:11:51,224 INFO L168 Benchmark]: Boogie Preprocessor took 24.88 ms. Allocated memory is still 140.0 MB. Free memory was 103.8 MB in the beginning and 102.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-20 10:11:51,225 INFO L168 Benchmark]: RCFGBuilder took 427.96 ms. Allocated memory is still 140.0 MB. Free memory was 102.6 MB in the beginning and 90.2 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-01-20 10:11:51,225 INFO L168 Benchmark]: TraceAbstraction took 105093.49 ms. Allocated memory was 140.0 MB in the beginning and 448.8 MB in the end (delta: 308.8 MB). Free memory was 89.8 MB in the beginning and 195.6 MB in the end (delta: -105.8 MB). Peak memory consumption was 203.0 MB. Max. memory is 7.1 GB. [2019-01-20 10:11:51,226 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.23 ms. Allocated memory is still 140.0 MB. Free memory is still 107.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.45 ms. Allocated memory is still 140.0 MB. Free memory was 105.9 MB in the beginning and 103.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.88 ms. Allocated memory is still 140.0 MB. Free memory was 103.8 MB in the beginning and 102.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 427.96 ms. Allocated memory is still 140.0 MB. Free memory was 102.6 MB in the beginning and 90.2 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105093.49 ms. Allocated memory was 140.0 MB in the beginning and 448.8 MB in the end (delta: 308.8 MB). Free memory was 89.8 MB in the beginning and 195.6 MB in the end (delta: -105.8 MB). Peak memory consumption was 203.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...