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-6-unlimited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0ed9222-m [2019-01-11 14:23:02,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 14:23:02,493 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 14:23:02,510 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 14:23:02,511 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 14:23:02,512 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 14:23:02,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 14:23:02,515 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 14:23:02,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 14:23:02,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 14:23:02,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 14:23:02,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 14:23:02,519 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 14:23:02,520 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 14:23:02,521 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 14:23:02,522 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 14:23:02,523 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 14:23:02,525 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 14:23:02,527 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 14:23:02,528 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 14:23:02,529 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 14:23:02,530 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 14:23:02,533 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 14:23:02,533 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 14:23:02,533 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 14:23:02,536 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 14:23:02,538 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 14:23:02,539 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 14:23:02,540 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 14:23:02,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 14:23:02,543 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 14:23:02,545 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 14:23:02,545 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 14:23:02,546 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 14:23:02,547 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 14:23:02,547 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 14:23:02,547 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-11 14:23:02,572 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 14:23:02,572 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 14:23:02,574 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 14:23:02,574 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 14:23:02,574 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 14:23:02,574 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 14:23:02,575 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 14:23:02,575 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 14:23:02,575 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 14:23:02,576 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 14:23:02,576 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 14:23:02,576 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 14:23:02,576 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 14:23:02,576 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 14:23:02,577 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 14:23:02,577 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 14:23:02,577 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 14:23:02,579 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 14:23:02,580 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 14:23:02,580 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 14:23:02,580 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 14:23:02,580 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 14:23:02,580 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 14:23:02,580 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 14:23:02,581 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 14:23:02,581 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 14:23:02,581 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 14:23:02,581 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 14:23:02,582 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 14:23:02,582 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 14:23:02,582 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 14:23:02,582 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 14:23:02,582 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 14:23:02,583 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 14:23:02,583 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 14:23:02,583 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 14:23:02,584 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 14:23:02,584 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 14:23:02,584 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 14:23:02,584 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 14:23:02,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 14:23:02,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 14:23:02,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 14:23:02,665 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 14:23:02,666 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 14:23:02,666 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl [2019-01-11 14:23:02,667 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-6-unlimited.bpl' [2019-01-11 14:23:02,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 14:23:02,711 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 14:23:02,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 14:23:02,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 14:23:02,712 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 14:23:02,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:23:02" (1/1) ... [2019-01-11 14:23:02,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:23:02" (1/1) ... [2019-01-11 14:23:02,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 14:23:02,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 14:23:02,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 14:23:02,766 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 14:23:02,776 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:23:02" (1/1) ... [2019-01-11 14:23:02,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:23:02" (1/1) ... [2019-01-11 14:23:02,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:23:02" (1/1) ... [2019-01-11 14:23:02,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:23:02" (1/1) ... [2019-01-11 14:23:02,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:23:02" (1/1) ... [2019-01-11 14:23:02,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:23:02" (1/1) ... [2019-01-11 14:23:02,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:23:02" (1/1) ... [2019-01-11 14:23:02,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 14:23:02,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 14:23:02,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 14:23:02,789 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 14:23:02,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:23:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 14:23:02,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 14:23:02,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 14:23:03,314 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 14:23:03,314 INFO L286 CfgBuilder]: Removed 15 assue(true) statements. [2019-01-11 14:23:03,315 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:23:03 BoogieIcfgContainer [2019-01-11 14:23:03,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 14:23:03,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-11 14:23:03,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-11 14:23:03,326 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-11 14:23:03,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 02:23:02" (1/2) ... [2019-01-11 14:23:03,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76878bba and model type speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 02:23:03, skipping insertion in model container [2019-01-11 14:23:03,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "speedup-poc-dd-6-unlimited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 02:23:03" (2/2) ... [2019-01-11 14:23:03,330 INFO L112 eAbstractionObserver]: Analyzing ICFG speedup-poc-dd-6-unlimited.bpl [2019-01-11 14:23:03,339 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-11 14:23:03,347 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2019-01-11 14:23:03,359 INFO L257 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-01-11 14:23:03,390 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-11 14:23:03,390 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-11 14:23:03,390 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-11 14:23:03,390 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-11 14:23:03,391 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-11 14:23:03,391 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-11 14:23:03,391 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-11 14:23:03,391 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-11 14:23:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-01-11 14:23:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-01-11 14:23:03,412 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:03,413 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2019-01-11 14:23:03,415 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:03,421 INFO L82 PathProgramCache]: Analyzing trace with hash 988, now seen corresponding path program 1 times [2019-01-11 14:23:03,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:03,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:03,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:03,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:03,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:03,598 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-11 14:23:03,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:23:03,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-11 14:23:03,602 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:23:03,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-11 14:23:03,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-11 14:23:03,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-11 14:23:03,618 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2019-01-11 14:23:03,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:03,816 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2019-01-11 14:23:03,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-11 14:23:03,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-01-11 14:23:03,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:03,832 INFO L225 Difference]: With dead ends: 29 [2019-01-11 14:23:03,832 INFO L226 Difference]: Without dead ends: 24 [2019-01-11 14:23:03,836 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-11 14:23:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-11 14:23:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 14. [2019-01-11 14:23:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-11 14:23:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 25 transitions. [2019-01-11 14:23:03,872 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 25 transitions. Word has length 2 [2019-01-11 14:23:03,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:03,874 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 25 transitions. [2019-01-11 14:23:03,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-11 14:23:03,874 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 25 transitions. [2019-01-11 14:23:03,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:23:03,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:03,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:23:03,875 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:03,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:03,876 INFO L82 PathProgramCache]: Analyzing trace with hash 30376, now seen corresponding path program 1 times [2019-01-11 14:23:03,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:03,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:03,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:03,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:03,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:03,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-11 14:23:03,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:03,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:03,967 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:23:03,969 INFO L207 CegarAbsIntRunner]: [0], [18], [27] [2019-01-11 14:23:04,013 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:04,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:04,101 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:04,103 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 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-11 14:23:04,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:04,109 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:04,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:04,111 INFO 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-11 14:23:04,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:04,127 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:04,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:04,396 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-11 14:23:04,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:04,724 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-01-11 14:23:04,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:04,897 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-01-11 14:23:04,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:04,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:05,104 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2019-01-11 14:23:05,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:05,135 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,204 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:23:05,310 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 24 treesize of output 30 [2019-01-11 14:23:05,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:23:05,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:05,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:23:05,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:05,395 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,444 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,620 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,798 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,813 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,828 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:05,872 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-11 14:23:05,874 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:05,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:05,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:05,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,005 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-11 14:23:06,006 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:06,075 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-11 14:23:06,075 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:06,123 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-11 14:23:06,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:06,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:23:06,144 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:06,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:23:06,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:23:06,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:06,147 INFO L87 Difference]: Start difference. First operand 14 states and 25 transitions. Second operand 6 states. [2019-01-11 14:23:06,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:06,614 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2019-01-11 14:23:06,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:23:06,614 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:23:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:06,615 INFO L225 Difference]: With dead ends: 47 [2019-01-11 14:23:06,616 INFO L226 Difference]: Without dead ends: 45 [2019-01-11 14:23:06,617 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-11 14:23:06,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-11 14:23:06,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 18. [2019-01-11 14:23:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-11 14:23:06,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 37 transitions. [2019-01-11 14:23:06,624 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 37 transitions. Word has length 3 [2019-01-11 14:23:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:06,624 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 37 transitions. [2019-01-11 14:23:06,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:23:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 37 transitions. [2019-01-11 14:23:06,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:23:06,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:06,626 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:23:06,626 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:06,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:06,626 INFO L82 PathProgramCache]: Analyzing trace with hash 30004, now seen corresponding path program 1 times [2019-01-11 14:23:06,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:06,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:06,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:06,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:06,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:06,684 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-11 14:23:06,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:06,684 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:06,685 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:23:06,685 INFO L207 CegarAbsIntRunner]: [0], [6], [27] [2019-01-11 14:23:06,687 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:06,687 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:06,700 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:06,700 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 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-11 14:23:06,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:06,701 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:06,701 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:06,701 INFO 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-11 14:23:06,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:06,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:06,731 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:06,788 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 21 treesize of output 24 [2019-01-11 14:23:06,795 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 24 treesize of output 30 [2019-01-11 14:23:06,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,826 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 26 treesize of output 40 [2019-01-11 14:23:06,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,837 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 28 treesize of output 54 [2019-01-11 14:23:06,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:06,855 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 30 treesize of output 72 [2019-01-11 14:23:06,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:06,884 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,947 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:06,975 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,021 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:07,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:07,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:07,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:07,316 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,333 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,353 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,371 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,406 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-11 14:23:07,407 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:07,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,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, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:07,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:07,524 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-11 14:23:07,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:07,538 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-11 14:23:07,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:07,543 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-11 14:23:07,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:23:07,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 14:23:07,563 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:23:07,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:23:07,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:23:07,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:23:07,564 INFO L87 Difference]: Start difference. First operand 18 states and 37 transitions. Second operand 4 states. [2019-01-11 14:23:07,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:07,630 INFO L93 Difference]: Finished difference Result 23 states and 60 transitions. [2019-01-11 14:23:07,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:23:07,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-01-11 14:23:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:07,631 INFO L225 Difference]: With dead ends: 23 [2019-01-11 14:23:07,632 INFO L226 Difference]: Without dead ends: 22 [2019-01-11 14:23:07,632 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-11 14:23:07,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-11 14:23:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-01-11 14:23:07,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-11 14:23:07,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 59 transitions. [2019-01-11 14:23:07,638 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 59 transitions. Word has length 3 [2019-01-11 14:23:07,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:07,639 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 59 transitions. [2019-01-11 14:23:07,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:23:07,639 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 59 transitions. [2019-01-11 14:23:07,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:23:07,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:07,640 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:23:07,640 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:07,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:07,641 INFO L82 PathProgramCache]: Analyzing trace with hash 30562, now seen corresponding path program 1 times [2019-01-11 14:23:07,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:07,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:07,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:07,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:07,740 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-11 14:23:07,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:07,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:07,741 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:23:07,741 INFO L207 CegarAbsIntRunner]: [0], [24], [27] [2019-01-11 14:23:07,744 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:07,744 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:07,751 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:07,751 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 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-11 14:23:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:07,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:07,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:07,752 INFO 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-11 14:23:07,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:07,762 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:07,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:07,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:07,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,816 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-11 14:23:07,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:07,884 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-11 14:23:08,011 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-01-11 14:23:08,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,077 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-11 14:23:08,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:08,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,224 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-11 14:23:08,226 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,251 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,279 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,305 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,432 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 21 treesize of output 24 [2019-01-11 14:23:08,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 14:23:08,455 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 26 treesize of output 40 [2019-01-11 14:23:08,472 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 28 treesize of output 54 [2019-01-11 14:23:08,485 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 30 treesize of output 72 [2019-01-11 14:23:08,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:23:08,503 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,607 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,629 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,647 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,791 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,803 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:08,867 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-11 14:23:08,867 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-11 14:23:08,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:08,929 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-11 14:23:08,931 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,075 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-11 14:23:09,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:101, output treesize:71 [2019-01-11 14:23:09,095 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-11 14:23:09,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:09,108 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-11 14:23:09,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:09,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:23:09,127 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:09,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:23:09,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:23:09,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:09,128 INFO L87 Difference]: Start difference. First operand 21 states and 59 transitions. Second operand 6 states. [2019-01-11 14:23:09,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:09,319 INFO L93 Difference]: Finished difference Result 39 states and 79 transitions. [2019-01-11 14:23:09,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:23:09,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:23:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:09,322 INFO L225 Difference]: With dead ends: 39 [2019-01-11 14:23:09,322 INFO L226 Difference]: Without dead ends: 36 [2019-01-11 14:23:09,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:09,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-11 14:23:09,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 23. [2019-01-11 14:23:09,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-11 14:23:09,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 67 transitions. [2019-01-11 14:23:09,330 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 67 transitions. Word has length 3 [2019-01-11 14:23:09,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:09,330 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 67 transitions. [2019-01-11 14:23:09,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:23:09,330 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 67 transitions. [2019-01-11 14:23:09,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-11 14:23:09,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:09,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-11 14:23:09,332 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:09,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:09,332 INFO L82 PathProgramCache]: Analyzing trace with hash 30128, now seen corresponding path program 1 times [2019-01-11 14:23:09,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:09,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:09,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:09,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:09,420 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-11 14:23:09,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:09,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:09,420 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 4 with the following transitions: [2019-01-11 14:23:09,421 INFO L207 CegarAbsIntRunner]: [0], [10], [27] [2019-01-11 14:23:09,424 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:09,424 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:09,431 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:09,431 INFO L272 AbstractInterpreter]: Visited 3 different actions 3 times. Never merged. Never widened. Performed 64 root evaluator evaluations with a maximum evaluation depth of 2. Performed 64 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-11 14:23:09,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:09,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:09,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:09,432 INFO 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-11 14:23:09,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:09,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:09,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:09,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:09,473 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 21 treesize of output 24 [2019-01-11 14:23:09,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 24 treesize of output 30 [2019-01-11 14:23:09,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,486 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:23:09,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:09,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,551 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 30 treesize of output 72 [2019-01-11 14:23:09,682 INFO L303 Elim1Store]: Index analysis took 129 ms [2019-01-11 14:23:09,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:09,684 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,873 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,898 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,930 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,943 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:09,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:09,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:10,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:10,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,071 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:10,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:10,131 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,145 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,162 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,178 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,212 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-11 14:23:10,212 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:10,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:10,265 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,300 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-11 14:23:10,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:10,312 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-11 14:23:10,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:10,338 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-11 14:23:10,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:10,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:23:10,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:10,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:23:10,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:23:10,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:10,359 INFO L87 Difference]: Start difference. First operand 23 states and 67 transitions. Second operand 6 states. [2019-01-11 14:23:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:10,522 INFO L93 Difference]: Finished difference Result 49 states and 101 transitions. [2019-01-11 14:23:10,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:23:10,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 3 [2019-01-11 14:23:10,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:10,525 INFO L225 Difference]: With dead ends: 49 [2019-01-11 14:23:10,525 INFO L226 Difference]: Without dead ends: 47 [2019-01-11 14:23:10,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-01-11 14:23:10,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-11 14:23:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 25. [2019-01-11 14:23:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-11 14:23:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2019-01-11 14:23:10,533 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 80 transitions. Word has length 3 [2019-01-11 14:23:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:10,533 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 80 transitions. [2019-01-11 14:23:10,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:23:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 80 transitions. [2019-01-11 14:23:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:23:10,534 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:10,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:23:10,534 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash 941528, now seen corresponding path program 1 times [2019-01-11 14:23:10,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:10,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:10,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:10,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:10,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:10,593 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-11 14:23:10,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:10,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:10,594 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:23:10,594 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [27] [2019-01-11 14:23:10,596 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:10,596 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:10,603 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:10,603 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-11 14:23:10,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:10,603 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:10,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:10,604 INFO 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-11 14:23:10,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:10,615 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:10,637 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:10,678 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 21 treesize of output 24 [2019-01-11 14:23:10,681 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 24 treesize of output 30 [2019-01-11 14:23:10,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,687 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 26 treesize of output 40 [2019-01-11 14:23:10,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,702 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 28 treesize of output 54 [2019-01-11 14:23:10,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,724 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,726 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 30 treesize of output 72 [2019-01-11 14:23:10,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:10,763 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,792 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,814 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,863 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,877 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:10,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:10,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:10,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:10,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:11,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:11,055 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,071 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,088 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,106 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,142 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-11 14:23:11,143 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:11,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:11,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,222 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-11 14:23:11,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:11,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:11,299 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 14:23:11,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:11,342 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-11 14:23:11,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 14:23:11,360 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-11 14:23:11,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:11,388 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-11 14:23:11,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:11,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:11,409 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:11,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:11,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:11,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:11,410 INFO L87 Difference]: Start difference. First operand 25 states and 80 transitions. Second operand 8 states. [2019-01-11 14:23:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:11,989 INFO L93 Difference]: Finished difference Result 61 states and 138 transitions. [2019-01-11 14:23:11,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:11,990 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:23:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:11,992 INFO L225 Difference]: With dead ends: 61 [2019-01-11 14:23:11,992 INFO L226 Difference]: Without dead ends: 57 [2019-01-11 14:23:11,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-11 14:23:12,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 29. [2019-01-11 14:23:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-11 14:23:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 98 transitions. [2019-01-11 14:23:12,001 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 98 transitions. Word has length 4 [2019-01-11 14:23:12,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:12,001 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 98 transitions. [2019-01-11 14:23:12,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 98 transitions. [2019-01-11 14:23:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:23:12,002 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:12,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:23:12,002 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:12,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:12,003 INFO L82 PathProgramCache]: Analyzing trace with hash 941590, now seen corresponding path program 1 times [2019-01-11 14:23:12,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:12,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:12,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:12,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:12,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:12,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:12,105 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-11 14:23:12,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:12,106 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:12,106 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:23:12,106 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [27] [2019-01-11 14:23:12,108 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:12,108 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:12,113 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:12,114 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-11 14:23:12,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:12,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:12,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:12,114 INFO 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-11 14:23:12,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:12,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:12,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:12,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:23:12,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,203 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-11 14:23:12,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,251 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-11 14:23:12,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,317 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-11 14:23:12,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,388 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-11 14:23:12,389 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,414 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,440 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,467 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,494 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,548 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 21 treesize of output 24 [2019-01-11 14:23:12,554 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 24 treesize of output 30 [2019-01-11 14:23:12,558 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 26 treesize of output 40 [2019-01-11 14:23:12,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:12,574 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 30 treesize of output 72 [2019-01-11 14:23:12,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:23:12,585 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,620 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,639 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,654 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,666 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,678 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,727 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-11 14:23:12,728 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 14:23:12,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,836 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-11 14:23:12,837 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:12,905 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-11 14:23:12,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 14:23:12,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:12,945 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:12,946 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-11 14:23:12,947 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,000 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-11 14:23:13,001 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-11 14:23:13,027 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-11 14:23:13,028 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:13,072 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-11 14:23:13,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:13,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:13,090 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:13,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:13,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:13,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:13,091 INFO L87 Difference]: Start difference. First operand 29 states and 98 transitions. Second operand 8 states. [2019-01-11 14:23:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:13,676 INFO L93 Difference]: Finished difference Result 59 states and 140 transitions. [2019-01-11 14:23:13,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:13,676 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:23:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:13,677 INFO L225 Difference]: With dead ends: 59 [2019-01-11 14:23:13,678 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 14:23:13,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 14:23:13,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-11 14:23:13,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 14:23:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 110 transitions. [2019-01-11 14:23:13,687 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 110 transitions. Word has length 4 [2019-01-11 14:23:13,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:13,687 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 110 transitions. [2019-01-11 14:23:13,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 110 transitions. [2019-01-11 14:23:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:23:13,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:13,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:23:13,688 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash 941156, now seen corresponding path program 1 times [2019-01-11 14:23:13,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:13,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:13,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:13,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:13,813 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-11 14:23:13,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:13,813 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:13,814 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:23:13,814 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [27] [2019-01-11 14:23:13,815 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:13,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:13,819 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:13,820 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-11 14:23:13,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:13,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:13,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:13,820 INFO 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-11 14:23:13,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:13,831 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:13,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:13,864 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 21 treesize of output 24 [2019-01-11 14:23:13,870 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2019-01-11 14:23:13,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,878 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 26 treesize of output 40 [2019-01-11 14:23:13,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,885 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 28 treesize of output 54 [2019-01-11 14:23:13,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:13,941 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 30 treesize of output 72 [2019-01-11 14:23:13,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:13,951 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:13,982 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,004 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,023 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,038 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,082 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:14,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:14,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:14,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:14,215 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,229 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,244 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,261 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,295 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-11 14:23:14,296 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:14,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:14,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:14,373 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:14,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:14,403 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:14,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 14:23:14,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:14,442 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-11 14:23:14,443 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-11 14:23:14,459 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-11 14:23:14,459 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:14,481 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-11 14:23:14,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:14,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:14,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:14,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:14,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:14,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:14,502 INFO L87 Difference]: Start difference. First operand 30 states and 110 transitions. Second operand 8 states. [2019-01-11 14:23:14,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:14,939 INFO L93 Difference]: Finished difference Result 57 states and 144 transitions. [2019-01-11 14:23:14,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:14,940 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:23:14,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:14,941 INFO L225 Difference]: With dead ends: 57 [2019-01-11 14:23:14,941 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 14:23:14,942 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-11 14:23:14,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 14:23:14,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 30. [2019-01-11 14:23:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-11 14:23:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 109 transitions. [2019-01-11 14:23:14,950 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 109 transitions. Word has length 4 [2019-01-11 14:23:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:14,951 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 109 transitions. [2019-01-11 14:23:14,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:14,951 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 109 transitions. [2019-01-11 14:23:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:23:14,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:14,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:23:14,952 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:14,952 INFO L82 PathProgramCache]: Analyzing trace with hash 941280, now seen corresponding path program 1 times [2019-01-11 14:23:14,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:14,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:14,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:14,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:14,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:15,062 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-11 14:23:15,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:15,062 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:15,062 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:23:15,063 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [27] [2019-01-11 14:23:15,063 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:15,063 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:15,067 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:15,068 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-11 14:23:15,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:15,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:15,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:15,068 INFO 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-11 14:23:15,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:15,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:15,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:15,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:15,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:15,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:15,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:15,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:15,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:15,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,292 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,312 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,383 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 21 treesize of output 24 [2019-01-11 14:23:15,387 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 24 treesize of output 30 [2019-01-11 14:23:15,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:23:15,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:15,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:23:15,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:15,423 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,840 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,980 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:15,997 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,009 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,022 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,057 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-11 14:23:16,057 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:16,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:16,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,132 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-11 14:23:16,133 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:16,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:16,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:23:16,170 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:16,206 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-11 14:23:16,206 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 14:23:16,230 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-11 14:23:16,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:16,258 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-11 14:23:16,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:16,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:16,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:16,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:16,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:16,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:16,280 INFO L87 Difference]: Start difference. First operand 30 states and 109 transitions. Second operand 8 states. [2019-01-11 14:23:16,471 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-01-11 14:23:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:16,926 INFO L93 Difference]: Finished difference Result 57 states and 158 transitions. [2019-01-11 14:23:16,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:16,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:23:16,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:16,928 INFO L225 Difference]: With dead ends: 57 [2019-01-11 14:23:16,928 INFO L226 Difference]: Without dead ends: 53 [2019-01-11 14:23:16,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-11 14:23:16,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-01-11 14:23:16,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-11 14:23:16,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 126 transitions. [2019-01-11 14:23:16,938 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 126 transitions. Word has length 4 [2019-01-11 14:23:16,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:16,938 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 126 transitions. [2019-01-11 14:23:16,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:16,939 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 126 transitions. [2019-01-11 14:23:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:23:16,939 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:16,939 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:23:16,940 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:16,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:16,940 INFO L82 PathProgramCache]: Analyzing trace with hash 929872, now seen corresponding path program 1 times [2019-01-11 14:23:16,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:16,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:16,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:16,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:16,941 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:17,014 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-11 14:23:17,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:17,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:17,014 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:23:17,015 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [27] [2019-01-11 14:23:17,016 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:17,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:17,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:17,020 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-11 14:23:17,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:17,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:17,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:17,021 INFO 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-11 14:23:17,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:17,031 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:17,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:17,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:17,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:17,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:17,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:17,243 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,261 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,278 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,319 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 21 treesize of output 24 [2019-01-11 14:23:17,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 14:23:17,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:23:17,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:17,332 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 30 treesize of output 72 [2019-01-11 14:23:17,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:17,340 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,365 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,386 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,401 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,412 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,424 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,458 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-11 14:23:17,459 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:17,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,526 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:17,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,556 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-11 14:23:17,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:17,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:17,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 14:23:17,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:17,621 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-11 14:23:17,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-11 14:23:17,640 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-11 14:23:17,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:17,654 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-11 14:23:17,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:17,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:23:17,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:17,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:17,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:17,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:17,675 INFO L87 Difference]: Start difference. First operand 31 states and 126 transitions. Second operand 8 states. [2019-01-11 14:23:18,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:18,097 INFO L93 Difference]: Finished difference Result 73 states and 228 transitions. [2019-01-11 14:23:18,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:18,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:23:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:18,098 INFO L225 Difference]: With dead ends: 73 [2019-01-11 14:23:18,098 INFO L226 Difference]: Without dead ends: 71 [2019-01-11 14:23:18,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-11 14:23:18,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 40. [2019-01-11 14:23:18,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-11 14:23:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 173 transitions. [2019-01-11 14:23:18,110 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 173 transitions. Word has length 4 [2019-01-11 14:23:18,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:18,110 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 173 transitions. [2019-01-11 14:23:18,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:18,110 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 173 transitions. [2019-01-11 14:23:18,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:23:18,111 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:18,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:23:18,111 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:18,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:18,112 INFO L82 PathProgramCache]: Analyzing trace with hash 930184, now seen corresponding path program 1 times [2019-01-11 14:23:18,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:18,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:18,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:18,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:18,113 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:18,244 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-11 14:23:18,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:18,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:18,245 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:23:18,245 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [29] [2019-01-11 14:23:18,246 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:18,246 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:18,258 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:18,258 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-11 14:23:18,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:18,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:18,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:18,258 INFO 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-11 14:23:18,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:18,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:18,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:18,306 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 21 treesize of output 24 [2019-01-11 14:23:18,308 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 24 treesize of output 30 [2019-01-11 14:23:18,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,325 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 26 treesize of output 40 [2019-01-11 14:23:18,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,333 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 28 treesize of output 54 [2019-01-11 14:23:18,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:23:18,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:18,362 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,390 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,411 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,428 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,441 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:18,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:18,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:18,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:18,605 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,624 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,639 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,656 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,690 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-11 14:23:18,690 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:18,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:18,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:18,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:18,813 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-11 14:23:18,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:18,827 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-11 14:23:18,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:18,837 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-11 14:23:18,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:18,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:23:18,857 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:18,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:23:18,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:23:18,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:18,858 INFO L87 Difference]: Start difference. First operand 40 states and 173 transitions. Second operand 6 states. [2019-01-11 14:23:19,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:19,059 INFO L93 Difference]: Finished difference Result 56 states and 192 transitions. [2019-01-11 14:23:19,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:23:19,059 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:23:19,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:19,060 INFO L225 Difference]: With dead ends: 56 [2019-01-11 14:23:19,060 INFO L226 Difference]: Without dead ends: 55 [2019-01-11 14:23:19,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-11 14:23:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-11 14:23:19,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 42. [2019-01-11 14:23:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-11 14:23:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 180 transitions. [2019-01-11 14:23:19,072 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 180 transitions. Word has length 4 [2019-01-11 14:23:19,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:19,072 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 180 transitions. [2019-01-11 14:23:19,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:23:19,073 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 180 transitions. [2019-01-11 14:23:19,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:23:19,073 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:19,073 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:23:19,074 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:19,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:19,074 INFO L82 PathProgramCache]: Analyzing trace with hash 945434, now seen corresponding path program 1 times [2019-01-11 14:23:19,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:19,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:19,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:19,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:19,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:19,146 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-11 14:23:19,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:19,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:19,147 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:23:19,147 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [27] [2019-01-11 14:23:19,150 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:19,150 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:19,154 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:19,155 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-11 14:23:19,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:19,155 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:19,155 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:19,155 INFO 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-11 14:23:19,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:19,164 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:19,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:19,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,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, 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-11 14:23:19,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,255 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-11 14:23:19,761 WARN L181 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-01-11 14:23:19,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:19,853 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-11 14:23:20,049 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-01-11 14:23:20,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,062 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-11 14:23:20,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,163 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-11 14:23:20,164 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,214 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,242 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,277 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,370 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 21 treesize of output 24 [2019-01-11 14:23:20,374 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 24 treesize of output 30 [2019-01-11 14:23:20,393 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 26 treesize of output 40 [2019-01-11 14:23:20,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:20,401 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 30 treesize of output 72 [2019-01-11 14:23:20,406 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:23:20,407 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,456 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,478 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,494 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,507 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,519 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,566 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-11 14:23:20,567 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 14:23:20,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,606 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-11 14:23:20,606 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:20,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 14:23:20,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:20,751 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-11 14:23:20,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:20,811 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-11 14:23:20,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:81, output treesize:55 [2019-01-11 14:23:20,834 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-11 14:23:20,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:20,853 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-11 14:23:20,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:20,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:23:20,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:20,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:20,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:20,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:20,874 INFO L87 Difference]: Start difference. First operand 42 states and 180 transitions. Second operand 8 states. [2019-01-11 14:23:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:21,394 INFO L93 Difference]: Finished difference Result 96 states and 313 transitions. [2019-01-11 14:23:21,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:21,394 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:23:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:21,396 INFO L225 Difference]: With dead ends: 96 [2019-01-11 14:23:21,396 INFO L226 Difference]: Without dead ends: 93 [2019-01-11 14:23:21,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:21,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-11 14:23:21,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 55. [2019-01-11 14:23:21,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-11 14:23:21,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 250 transitions. [2019-01-11 14:23:21,410 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 250 transitions. Word has length 4 [2019-01-11 14:23:21,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:21,410 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 250 transitions. [2019-01-11 14:23:21,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:21,410 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 250 transitions. [2019-01-11 14:23:21,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:23:21,411 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:21,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:23:21,411 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:21,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:21,412 INFO L82 PathProgramCache]: Analyzing trace with hash 945000, now seen corresponding path program 1 times [2019-01-11 14:23:21,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:21,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:21,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:21,413 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:21,486 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-11 14:23:21,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:21,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:21,486 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:23:21,486 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [27] [2019-01-11 14:23:21,487 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:21,487 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:21,491 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:21,491 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-11 14:23:21,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:21,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:21,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:21,492 INFO 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-11 14:23:21,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:21,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:21,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:21,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:21,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:23:21,550 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 24 treesize of output 30 [2019-01-11 14:23:21,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,606 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 26 treesize of output 40 [2019-01-11 14:23:21,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,618 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 28 treesize of output 54 [2019-01-11 14:23:21,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,626 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 30 treesize of output 72 [2019-01-11 14:23:21,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:21,636 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,664 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,685 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,703 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,718 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:21,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:21,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,834 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:21,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:21,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:21,884 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,901 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,917 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,933 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:21,966 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-11 14:23:21,966 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:22,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:22,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,033 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-11 14:23:22,034 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:22,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:23:22,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,098 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-11 14:23:22,099 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:38 [2019-01-11 14:23:22,124 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-11 14:23:22,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:22,148 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-11 14:23:22,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:22,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:22,168 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:22,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:22,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:22,169 INFO L87 Difference]: Start difference. First operand 55 states and 250 transitions. Second operand 8 states. [2019-01-11 14:23:22,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:22,649 INFO L93 Difference]: Finished difference Result 84 states and 299 transitions. [2019-01-11 14:23:22,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:22,649 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:23:22,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:22,650 INFO L225 Difference]: With dead ends: 84 [2019-01-11 14:23:22,651 INFO L226 Difference]: Without dead ends: 82 [2019-01-11 14:23:22,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-11 14:23:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2019-01-11 14:23:22,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-11 14:23:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 270 transitions. [2019-01-11 14:23:22,664 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 270 transitions. Word has length 4 [2019-01-11 14:23:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:22,664 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 270 transitions. [2019-01-11 14:23:22,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 270 transitions. [2019-01-11 14:23:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:23:22,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:22,665 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:23:22,665 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:22,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:22,666 INFO L82 PathProgramCache]: Analyzing trace with hash 946922, now seen corresponding path program 1 times [2019-01-11 14:23:22,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:22,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:22,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:22,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:22,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:22,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:22,730 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:23:22,730 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [27] [2019-01-11 14:23:22,731 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:22,731 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:22,735 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:22,735 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-11 14:23:22,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:22,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:22,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:22,736 INFO 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-11 14:23:22,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:22,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:22,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:22,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:23:22,801 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 24 treesize of output 30 [2019-01-11 14:23:22,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,806 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 26 treesize of output 40 [2019-01-11 14:23:22,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,889 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 28 treesize of output 54 [2019-01-11 14:23:22,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,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, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:23:22,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:22,908 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:23:22,909 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,948 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,972 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:22,991 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,007 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,058 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-11 14:23:23,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,107 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-11 14:23:23,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 14:23:23,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:23,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,344 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-11 14:23:23,345 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,380 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,420 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,446 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,472 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,516 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-11 14:23:23,517 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 14:23:23,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,565 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-11 14:23:23,566 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,611 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-11 14:23:23,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 14:23:23,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:23,670 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:23,671 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-11 14:23:23,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:23,720 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-11 14:23:23,720 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-11 14:23:23,765 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-11 14:23:23,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:23,787 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-11 14:23:23,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:23,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:23,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:23,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:23,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:23,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:23,806 INFO L87 Difference]: Start difference. First operand 58 states and 270 transitions. Second operand 8 states. [2019-01-11 14:23:24,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:24,533 INFO L93 Difference]: Finished difference Result 91 states and 313 transitions. [2019-01-11 14:23:24,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:24,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:23:24,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:24,535 INFO L225 Difference]: With dead ends: 91 [2019-01-11 14:23:24,535 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 14:23:24,536 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-11 14:23:24,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 14:23:24,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 59. [2019-01-11 14:23:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-11 14:23:24,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 277 transitions. [2019-01-11 14:23:24,552 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 277 transitions. Word has length 4 [2019-01-11 14:23:24,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:24,552 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 277 transitions. [2019-01-11 14:23:24,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:24,552 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 277 transitions. [2019-01-11 14:23:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:23:24,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:24,553 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:23:24,553 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:24,554 INFO L82 PathProgramCache]: Analyzing trace with hash 934028, now seen corresponding path program 1 times [2019-01-11 14:23:24,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:24,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:24,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:24,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:24,555 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:24,693 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-11 14:23:24,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:24,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:24,694 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:23:24,694 INFO L207 CegarAbsIntRunner]: [0], [10], [28], [29] [2019-01-11 14:23:24,695 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:24,696 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:24,701 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:24,706 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-11 14:23:24,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:24,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:24,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:24,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:23:24,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:24,725 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:24,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:24,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:23:24,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:23:24,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:23:24,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:24,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,014 INFO L303 Elim1Store]: Index analysis took 109 ms [2019-01-11 14:23:25,015 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 28 treesize of output 50 [2019-01-11 14:23:25,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,147 INFO L303 Elim1Store]: Index analysis took 130 ms [2019-01-11 14:23:25,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:23:25,295 INFO L303 Elim1Store]: Index analysis took 146 ms [2019-01-11 14:23:25,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:23:25,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,430 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,451 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,481 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,495 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:23:25,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:23:25,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:23:25,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:23:25,621 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,636 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,651 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,667 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:25,698 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-11 14:23:25,698 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:64, output treesize:67 [2019-01-11 14:23:25,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:25,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:25,729 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:25,822 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-11 14:23:25,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:92 [2019-01-11 14:23:26,072 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 29 [2019-01-11 14:23:26,074 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-11 14:23:26,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:26,077 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-11 14:23:26,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:23:26,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 5 [2019-01-11 14:23:26,095 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:23:26,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:23:26,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:23:26,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:23:26,096 INFO L87 Difference]: Start difference. First operand 59 states and 277 transitions. Second operand 4 states. [2019-01-11 14:23:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:26,196 INFO L93 Difference]: Finished difference Result 90 states and 454 transitions. [2019-01-11 14:23:26,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:23:26,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-11 14:23:26,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:26,198 INFO L225 Difference]: With dead ends: 90 [2019-01-11 14:23:26,198 INFO L226 Difference]: Without dead ends: 89 [2019-01-11 14:23:26,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-01-11 14:23:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-11 14:23:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2019-01-11 14:23:26,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-11 14:23:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 449 transitions. [2019-01-11 14:23:26,215 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 449 transitions. Word has length 4 [2019-01-11 14:23:26,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:26,215 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 449 transitions. [2019-01-11 14:23:26,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:23:26,215 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 449 transitions. [2019-01-11 14:23:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:23:26,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:26,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:23:26,217 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:26,217 INFO L82 PathProgramCache]: Analyzing trace with hash 933592, now seen corresponding path program 1 times [2019-01-11 14:23:26,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:26,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:26,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:26,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:26,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:26,302 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-11 14:23:26,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:26,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:26,302 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:23:26,303 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [27] [2019-01-11 14:23:26,304 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:26,304 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:26,308 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:26,308 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-11 14:23:26,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:26,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:26,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:26,309 INFO 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-11 14:23:26,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:26,317 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:26,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:26,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,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 48 treesize of output 54 [2019-01-11 14:23:26,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,385 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:26,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:26,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:26,479 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,581 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 21 treesize of output 24 [2019-01-11 14:23:26,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 14:23:26,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:23:26,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:26,595 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 30 treesize of output 72 [2019-01-11 14:23:26,604 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:26,605 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,634 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,657 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,674 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,695 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,707 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,740 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-11 14:23:26,740 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:26,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:26,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:26,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:26,994 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:26,994 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:27,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:23:27,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,060 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-11 14:23:27,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 14:23:27,080 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-11 14:23:27,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:27,103 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-11 14:23:27,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:27,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:27,123 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:27,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:27,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:27,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:27,124 INFO L87 Difference]: Start difference. First operand 83 states and 449 transitions. Second operand 8 states. [2019-01-11 14:23:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:27,520 INFO L93 Difference]: Finished difference Result 121 states and 532 transitions. [2019-01-11 14:23:27,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:27,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 4 [2019-01-11 14:23:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:27,523 INFO L225 Difference]: With dead ends: 121 [2019-01-11 14:23:27,523 INFO L226 Difference]: Without dead ends: 119 [2019-01-11 14:23:27,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:27,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-11 14:23:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 91. [2019-01-11 14:23:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 14:23:27,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-11 14:23:27,542 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-11 14:23:27,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:27,542 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-11 14:23:27,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:27,542 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-11 14:23:27,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-11 14:23:27,543 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:27,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-11 14:23:27,544 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:27,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash 937872, now seen corresponding path program 1 times [2019-01-11 14:23:27,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:27,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:27,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:27,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:27,614 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-11 14:23:27,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:27,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:27,615 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-11 14:23:27,615 INFO L207 CegarAbsIntRunner]: [0], [14], [28], [29] [2019-01-11 14:23:27,616 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:27,616 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:27,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:27,619 INFO L272 AbstractInterpreter]: Visited 4 different actions 4 times. Never merged. Never widened. Performed 66 root evaluator evaluations with a maximum evaluation depth of 2. Performed 66 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-11 14:23:27,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:27,620 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:27,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:27,620 INFO 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-11 14:23:27,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:27,632 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:27,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:27,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:23:27,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:23:27,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,658 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 26 treesize of output 36 [2019-01-11 14:23:27,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,729 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 28 treesize of output 50 [2019-01-11 14:23:27,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:23:27,748 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:23:27,749 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,774 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,795 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,812 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,825 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:23:27,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:23:27,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:23:27,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:27,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:23:27,967 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,983 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:27,997 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,013 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,044 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-11 14:23:28,044 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-11 14:23:28,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:23:28,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,102 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-11 14:23:28,103 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:72, output treesize:46 [2019-01-11 14:23:28,119 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-11 14:23:28,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:28,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:28,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:23:28,173 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:28,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:23:28,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:23:28,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:23:28,174 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 6 states. [2019-01-11 14:23:28,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:28,450 INFO L93 Difference]: Finished difference Result 110 states and 511 transitions. [2019-01-11 14:23:28,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:23:28,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2019-01-11 14:23:28,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:28,452 INFO L225 Difference]: With dead ends: 110 [2019-01-11 14:23:28,453 INFO L226 Difference]: Without dead ends: 109 [2019-01-11 14:23:28,453 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-11 14:23:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-11 14:23:28,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2019-01-11 14:23:28,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-11 14:23:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 493 transitions. [2019-01-11 14:23:28,466 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 493 transitions. Word has length 4 [2019-01-11 14:23:28,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:28,467 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 493 transitions. [2019-01-11 14:23:28,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:23:28,467 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 493 transitions. [2019-01-11 14:23:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:28,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:28,468 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-11 14:23:28,468 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:28,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:28,469 INFO L82 PathProgramCache]: Analyzing trace with hash 29182900, now seen corresponding path program 2 times [2019-01-11 14:23:28,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:28,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:28,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:28,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:28,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:28,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:28,587 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:28,587 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:28,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:28,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:28,588 INFO 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-11 14:23:28,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:28,596 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:28,640 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:28,640 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:28,641 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:28,698 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 21 treesize of output 24 [2019-01-11 14:23:28,700 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 24 treesize of output 30 [2019-01-11 14:23:28,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,710 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 26 treesize of output 40 [2019-01-11 14:23:28,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:28,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,727 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,730 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 30 treesize of output 72 [2019-01-11 14:23:28,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,742 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:23:28,742 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,784 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,867 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,886 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,901 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:28,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:23:28,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:28,990 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-11 14:23:29,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,037 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-11 14:23:29,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 14:23:29,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,169 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-11 14:23:29,170 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,194 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,221 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,245 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,281 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,327 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-11 14:23:29,328 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:92, output treesize:91 [2019-01-11 14:23:29,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,370 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-11 14:23:29,371 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,416 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-11 14:23:29,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 14:23:29,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,445 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 103 [2019-01-11 14:23:29,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,495 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-11 14:23:29,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:71 [2019-01-11 14:23:29,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:29,525 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-11 14:23:29,526 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:29,578 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-11 14:23:29,579 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:57 [2019-01-11 14:23:29,820 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-11 14:23:29,820 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:30,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:30,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:30,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:30,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:30,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:30,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:30,381 INFO L87 Difference]: Start difference. First operand 91 states and 493 transitions. Second operand 10 states. [2019-01-11 14:23:31,297 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-01-11 14:23:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:31,819 INFO L93 Difference]: Finished difference Result 133 states and 606 transitions. [2019-01-11 14:23:31,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:31,820 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:31,822 INFO L225 Difference]: With dead ends: 133 [2019-01-11 14:23:31,822 INFO L226 Difference]: Without dead ends: 128 [2019-01-11 14:23:31,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:31,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-01-11 14:23:31,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2019-01-11 14:23:31,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-11 14:23:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 538 transitions. [2019-01-11 14:23:31,838 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 538 transitions. Word has length 5 [2019-01-11 14:23:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:31,838 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 538 transitions. [2019-01-11 14:23:31,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 538 transitions. [2019-01-11 14:23:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:31,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:31,840 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:31,840 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash 29172052, now seen corresponding path program 1 times [2019-01-11 14:23:31,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:31,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:31,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:31,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:31,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:31,940 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-11 14:23:31,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:31,940 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:31,940 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:31,941 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [29] [2019-01-11 14:23:31,942 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:31,943 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:31,947 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:31,947 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:23:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:31,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:31,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:31,948 INFO 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-11 14:23:31,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:31,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:31,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:32,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:23:32,018 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2019-01-11 14:23:32,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:23:32,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:32,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:23:32,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:32,085 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,113 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,134 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,153 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,166 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,180 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:32,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:32,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:32,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:32,344 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,360 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,376 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,390 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,424 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-11 14:23:32,424 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:32,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:32,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,490 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-11 14:23:32,491 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:32,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:32,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:23:32,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:32,554 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-11 14:23:32,555 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 14:23:32,620 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-11 14:23:32,620 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:32,645 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-11 14:23:32,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:32,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:32,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:32,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:32,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:32,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:32,666 INFO L87 Difference]: Start difference. First operand 95 states and 538 transitions. Second operand 8 states. [2019-01-11 14:23:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:33,018 INFO L93 Difference]: Finished difference Result 125 states and 622 transitions. [2019-01-11 14:23:33,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:33,018 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:33,020 INFO L225 Difference]: With dead ends: 125 [2019-01-11 14:23:33,020 INFO L226 Difference]: Without dead ends: 124 [2019-01-11 14:23:33,021 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-11 14:23:33,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-11 14:23:33,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2019-01-11 14:23:33,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-11 14:23:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 589 transitions. [2019-01-11 14:23:33,041 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 589 transitions. Word has length 5 [2019-01-11 14:23:33,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:33,041 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 589 transitions. [2019-01-11 14:23:33,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:33,041 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 589 transitions. [2019-01-11 14:23:33,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:33,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:33,042 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:33,043 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:33,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:33,043 INFO L82 PathProgramCache]: Analyzing trace with hash 29187302, now seen corresponding path program 1 times [2019-01-11 14:23:33,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:33,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:33,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:33,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:33,044 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:33,247 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-11 14:23:33,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:33,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:33,248 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:33,248 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [27] [2019-01-11 14:23:33,249 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:33,249 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:33,252 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:33,252 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:23:33,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:33,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:33,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:33,253 INFO 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-11 14:23:33,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:33,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:33,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:33,310 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,311 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-11 14:23:33,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,370 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-11 14:23:33,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,431 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-11 14:23:33,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,517 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-11 14:23:33,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,615 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-11 14:23:33,616 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,649 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,690 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,718 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,785 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 21 treesize of output 24 [2019-01-11 14:23:33,787 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 24 treesize of output 30 [2019-01-11 14:23:33,790 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 26 treesize of output 40 [2019-01-11 14:23:33,793 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 28 treesize of output 54 [2019-01-11 14:23:33,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:23:33,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:23:33,801 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,837 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,858 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,875 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,888 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,901 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:33,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:33,948 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:23:33,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:33,985 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-11 14:23:33,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,049 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-11 14:23:34,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:23:34,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,088 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-11 14:23:34,089 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,137 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-11 14:23:34,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 14:23:34,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,178 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:34,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:34,180 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-11 14:23:34,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:34,230 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-11 14:23:34,231 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 14:23:34,253 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-11 14:23:34,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:34,297 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-11 14:23:34,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:34,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:34,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:34,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:34,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:34,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:34,317 INFO L87 Difference]: Start difference. First operand 102 states and 589 transitions. Second operand 10 states. [2019-01-11 14:23:34,457 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-01-11 14:23:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:36,110 INFO L93 Difference]: Finished difference Result 149 states and 665 transitions. [2019-01-11 14:23:36,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:36,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:36,113 INFO L225 Difference]: With dead ends: 149 [2019-01-11 14:23:36,113 INFO L226 Difference]: Without dead ends: 145 [2019-01-11 14:23:36,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:23:36,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-11 14:23:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 105. [2019-01-11 14:23:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-11 14:23:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 605 transitions. [2019-01-11 14:23:36,133 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 605 transitions. Word has length 5 [2019-01-11 14:23:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:36,134 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 605 transitions. [2019-01-11 14:23:36,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 605 transitions. [2019-01-11 14:23:36,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:36,135 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:36,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:36,135 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:36,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:36,135 INFO L82 PathProgramCache]: Analyzing trace with hash 29186868, now seen corresponding path program 1 times [2019-01-11 14:23:36,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:36,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:36,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:36,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:36,136 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:36,296 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 14:23:36,339 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-11 14:23:36,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:36,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:36,339 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:36,339 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [27] [2019-01-11 14:23:36,340 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:36,340 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:36,343 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:36,343 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:23:36,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:36,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:36,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:36,344 INFO 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-11 14:23:36,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:36,357 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:36,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:36,384 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 21 treesize of output 24 [2019-01-11 14:23:36,388 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 24 treesize of output 30 [2019-01-11 14:23:36,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,394 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 26 treesize of output 40 [2019-01-11 14:23:36,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,404 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 28 treesize of output 54 [2019-01-11 14:23:36,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:23:36,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:36,424 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,453 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,475 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,508 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,522 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:36,582 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,583 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:36,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:36,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:36,671 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,686 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,703 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,719 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:36,753 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:36,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:36,811 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:36,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:36,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 14:23:36,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,905 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-11 14:23:36,906 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 14:23:36,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,939 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:36,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:36,941 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 14:23:36,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:36,977 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-11 14:23:36,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-11 14:23:36,999 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-11 14:23:37,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:37,044 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-11 14:23:37,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:37,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:37,063 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:37,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:37,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:37,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:37,064 INFO L87 Difference]: Start difference. First operand 105 states and 605 transitions. Second operand 10 states. [2019-01-11 14:23:37,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:37,647 INFO L93 Difference]: Finished difference Result 138 states and 662 transitions. [2019-01-11 14:23:37,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:37,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:37,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:37,650 INFO L225 Difference]: With dead ends: 138 [2019-01-11 14:23:37,651 INFO L226 Difference]: Without dead ends: 136 [2019-01-11 14:23:37,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:37,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-11 14:23:37,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2019-01-11 14:23:37,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-11 14:23:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 598 transitions. [2019-01-11 14:23:37,672 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 598 transitions. Word has length 5 [2019-01-11 14:23:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:37,672 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 598 transitions. [2019-01-11 14:23:37,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:37,672 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 598 transitions. [2019-01-11 14:23:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:37,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:37,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:37,673 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:37,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:37,674 INFO L82 PathProgramCache]: Analyzing trace with hash 29188666, now seen corresponding path program 1 times [2019-01-11 14:23:37,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:37,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:37,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:37,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:37,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:37,805 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-11 14:23:37,825 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-11 14:23:37,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:37,825 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:37,826 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:37,826 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [27] [2019-01-11 14:23:37,827 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:37,827 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:37,832 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:37,832 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:23:37,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:37,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:37,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:37,833 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-11 14:23:37,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:37,844 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:37,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:37,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,878 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-11 14:23:37,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,927 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-11 14:23:37,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:37,972 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-11 14:23:38,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,028 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-11 14:23:38,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,108 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-11 14:23:38,108 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,137 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,164 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,192 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,258 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 21 treesize of output 24 [2019-01-11 14:23:38,261 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 24 treesize of output 30 [2019-01-11 14:23:38,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:23:38,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:38,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:23:38,309 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:23:38,309 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,668 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,694 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,715 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,733 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,751 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,800 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-11 14:23:38,801 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 14:23:38,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,828 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-11 14:23:38,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,871 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-11 14:23:38,872 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 14:23:38,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,903 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:38,904 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-11 14:23:38,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:38,951 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-11 14:23:38,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-11 14:23:38,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:38,984 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 45 treesize of output 115 [2019-01-11 14:23:38,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:39,056 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-11 14:23:39,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-11 14:23:39,073 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-11 14:23:39,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:39,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:39,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:39,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:39,116 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:39,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:39,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:39,117 INFO L87 Difference]: Start difference. First operand 104 states and 598 transitions. Second operand 10 states. [2019-01-11 14:23:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:39,702 INFO L93 Difference]: Finished difference Result 152 states and 738 transitions. [2019-01-11 14:23:39,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:39,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:39,707 INFO L225 Difference]: With dead ends: 152 [2019-01-11 14:23:39,708 INFO L226 Difference]: Without dead ends: 151 [2019-01-11 14:23:39,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:23:39,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-11 14:23:39,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 106. [2019-01-11 14:23:39,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-11 14:23:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 612 transitions. [2019-01-11 14:23:39,729 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 612 transitions. Word has length 5 [2019-01-11 14:23:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:39,730 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 612 transitions. [2019-01-11 14:23:39,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 612 transitions. [2019-01-11 14:23:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:39,731 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:39,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:39,731 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:39,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:39,731 INFO L82 PathProgramCache]: Analyzing trace with hash 29188790, now seen corresponding path program 1 times [2019-01-11 14:23:39,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:39,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:39,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:39,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:39,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:39,856 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-11 14:23:39,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:39,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:39,857 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:39,857 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [27] [2019-01-11 14:23:39,859 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:39,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:39,862 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:39,862 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:23:39,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:39,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:39,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:39,863 INFO 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-11 14:23:39,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:39,876 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:39,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:39,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:39,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,932 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-11 14:23:39,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:39,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:23:40,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 14:23:40,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,138 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-11 14:23:40,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,218 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-11 14:23:40,218 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,290 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,354 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,388 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,445 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 21 treesize of output 24 [2019-01-11 14:23:40,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 14:23:40,450 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 26 treesize of output 40 [2019-01-11 14:23:40,454 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 28 treesize of output 54 [2019-01-11 14:23:40,457 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 30 treesize of output 72 [2019-01-11 14:23:40,461 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:23:40,462 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,498 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,519 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,534 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,546 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,558 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:40,605 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:23:40,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,641 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-11 14:23:40,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,686 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-11 14:23:40,686 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:23:40,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,723 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:40,724 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-11 14:23:40,724 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:40,773 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-11 14:23:40,774 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-11 14:23:40,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:40,812 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:40,813 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-11 14:23:40,814 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:41,062 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-11 14:23:41,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:57 [2019-01-11 14:23:42,498 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-11 14:23:42,498 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:42,540 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-11 14:23:42,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:42,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:42,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:42,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:42,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:42,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:42,562 INFO L87 Difference]: Start difference. First operand 106 states and 612 transitions. Second operand 10 states. [2019-01-11 14:23:43,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:43,338 INFO L93 Difference]: Finished difference Result 141 states and 665 transitions. [2019-01-11 14:23:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:43,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:43,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:43,341 INFO L225 Difference]: With dead ends: 141 [2019-01-11 14:23:43,342 INFO L226 Difference]: Without dead ends: 140 [2019-01-11 14:23:43,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:43,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-11 14:23:43,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 107. [2019-01-11 14:23:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-11 14:23:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 619 transitions. [2019-01-11 14:23:43,365 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 619 transitions. Word has length 5 [2019-01-11 14:23:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:43,365 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 619 transitions. [2019-01-11 14:23:43,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 619 transitions. [2019-01-11 14:23:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:43,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:43,366 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:43,366 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:43,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:43,367 INFO L82 PathProgramCache]: Analyzing trace with hash 29175212, now seen corresponding path program 1 times [2019-01-11 14:23:43,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:43,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:43,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:43,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:43,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:43,466 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-11 14:23:43,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:43,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:43,467 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:43,467 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [27] [2019-01-11 14:23:43,469 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:43,469 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:43,471 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:43,472 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:23:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:43,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:43,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:43,472 INFO 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-11 14:23:43,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:43,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:43,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:43,514 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 21 treesize of output 24 [2019-01-11 14:23:43,518 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 24 treesize of output 30 [2019-01-11 14:23:43,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,527 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 26 treesize of output 40 [2019-01-11 14:23:43,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,538 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 28 treesize of output 54 [2019-01-11 14:23:43,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,572 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 30 treesize of output 72 [2019-01-11 14:23:43,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:43,588 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,622 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,651 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,681 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:43,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:43,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:43,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:43,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:43,888 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,905 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,922 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,939 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:43,973 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-11 14:23:43,973 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:44,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:44,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:44,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:44,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,071 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:44,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 14:23:44,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,112 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-11 14:23:44,112 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:42 [2019-01-11 14:23:44,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:44,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-11 14:23:44,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:44,177 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-11 14:23:44,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-11 14:23:44,194 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-11 14:23:44,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:44,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:44,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:44,240 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:44,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:44,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:44,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:44,240 INFO L87 Difference]: Start difference. First operand 107 states and 619 transitions. Second operand 10 states. [2019-01-11 14:23:44,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:44,898 INFO L93 Difference]: Finished difference Result 163 states and 816 transitions. [2019-01-11 14:23:44,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:23:44,899 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:44,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:44,901 INFO L225 Difference]: With dead ends: 163 [2019-01-11 14:23:44,901 INFO L226 Difference]: Without dead ends: 162 [2019-01-11 14:23:44,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:23:44,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-01-11 14:23:44,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 116. [2019-01-11 14:23:44,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-11 14:23:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 682 transitions. [2019-01-11 14:23:44,927 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 682 transitions. Word has length 5 [2019-01-11 14:23:44,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:44,927 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 682 transitions. [2019-01-11 14:23:44,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 682 transitions. [2019-01-11 14:23:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:44,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:44,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:44,929 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:44,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:44,929 INFO L82 PathProgramCache]: Analyzing trace with hash 29179614, now seen corresponding path program 1 times [2019-01-11 14:23:44,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:44,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:44,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:44,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:44,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:45,071 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 14:23:45,146 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-11 14:23:45,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:45,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:45,147 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:45,147 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [27] [2019-01-11 14:23:45,151 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:45,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:45,153 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:45,154 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:23:45,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:45,154 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:45,154 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:45,154 INFO 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-11 14:23:45,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:45,165 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:45,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:45,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,197 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-11 14:23:45,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,237 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-11 14:23:45,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:45,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:23:45,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,414 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-11 14:23:45,415 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,441 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:23:45,563 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 24 treesize of output 30 [2019-01-11 14:23:45,565 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 26 treesize of output 40 [2019-01-11 14:23:45,567 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 28 treesize of output 54 [2019-01-11 14:23:45,569 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 30 treesize of output 72 [2019-01-11 14:23:45,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:23:45,574 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,607 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,628 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,645 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,658 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,671 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:45,717 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:23:45,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,768 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-11 14:23:45,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:45,812 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:23:45,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,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, 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-11 14:23:45,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:45,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 14:23:45,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,940 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:45,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:45,942 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-11 14:23:45,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:45,995 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-11 14:23:45,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 14:23:46,017 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-11 14:23:46,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:46,055 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-11 14:23:46,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:46,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:46,074 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:46,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:46,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:46,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:46,075 INFO L87 Difference]: Start difference. First operand 116 states and 682 transitions. Second operand 10 states. [2019-01-11 14:23:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:46,777 INFO L93 Difference]: Finished difference Result 163 states and 796 transitions. [2019-01-11 14:23:46,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:46,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:46,780 INFO L225 Difference]: With dead ends: 163 [2019-01-11 14:23:46,780 INFO L226 Difference]: Without dead ends: 160 [2019-01-11 14:23:46,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-01-11 14:23:46,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2019-01-11 14:23:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-01-11 14:23:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 724 transitions. [2019-01-11 14:23:46,800 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 724 transitions. Word has length 5 [2019-01-11 14:23:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:46,800 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 724 transitions. [2019-01-11 14:23:46,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:46,800 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 724 transitions. [2019-01-11 14:23:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:46,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:46,801 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:46,802 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:46,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:46,802 INFO L82 PathProgramCache]: Analyzing trace with hash 29179180, now seen corresponding path program 1 times [2019-01-11 14:23:46,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:46,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:46,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:46,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:46,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:46,966 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-11 14:23:46,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:46,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:46,967 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:46,967 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [27] [2019-01-11 14:23:46,968 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:46,968 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:46,971 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:46,971 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:23:46,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:46,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:46,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:46,972 INFO 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-11 14:23:46,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:46,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:47,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:47,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:47,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:47,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:47,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:47,244 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,264 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,283 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,331 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 21 treesize of output 24 [2019-01-11 14:23:47,334 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 24 treesize of output 30 [2019-01-11 14:23:47,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:23:47,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, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:47,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:23:47,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, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:47,352 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,378 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,398 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,414 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,428 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,440 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:47,473 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:47,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:23:47,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:47,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:47,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,586 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:23:47,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,627 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-11 14:23:47,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 14:23:47,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,692 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,695 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:47,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:47,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 14:23:47,698 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:47,733 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-11 14:23:47,734 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-11 14:23:47,754 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-11 14:23:47,755 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:47,793 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-11 14:23:47,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:47,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:23:47,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:47,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:47,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:47,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:47,812 INFO L87 Difference]: Start difference. First operand 122 states and 724 transitions. Second operand 10 states. [2019-01-11 14:23:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:48,416 INFO L93 Difference]: Finished difference Result 165 states and 829 transitions. [2019-01-11 14:23:48,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:48,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:48,419 INFO L225 Difference]: With dead ends: 165 [2019-01-11 14:23:48,419 INFO L226 Difference]: Without dead ends: 163 [2019-01-11 14:23:48,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:23:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-01-11 14:23:48,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2019-01-11 14:23:48,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-11 14:23:48,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 745 transitions. [2019-01-11 14:23:48,439 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 745 transitions. Word has length 5 [2019-01-11 14:23:48,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:48,439 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 745 transitions. [2019-01-11 14:23:48,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:48,440 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 745 transitions. [2019-01-11 14:23:48,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:48,440 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:48,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:48,441 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:48,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:48,441 INFO L82 PathProgramCache]: Analyzing trace with hash 28829936, now seen corresponding path program 1 times [2019-01-11 14:23:48,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:48,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:48,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:48,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:48,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:48,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:48,679 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-11 14:23:48,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:48,680 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:48,680 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:48,680 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [29] [2019-01-11 14:23:48,682 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:48,683 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:48,685 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:48,686 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:23:48,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:48,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:48,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:48,687 INFO 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-11 14:23:48,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:48,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:48,714 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:48,873 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-11 14:23:48,886 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 21 treesize of output 24 [2019-01-11 14:23:48,902 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2019-01-11 14:23:48,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,968 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 26 treesize of output 40 [2019-01-11 14:23:48,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:48,982 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:48,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:23:48,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:48,998 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,026 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,050 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,082 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,095 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:49,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:49,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:49,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:49,246 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,264 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,280 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,297 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,330 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-11 14:23:49,331 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:49,814 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-01-11 14:23:49,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:23:49,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,849 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-11 14:23:49,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:23:49,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:49,874 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:49,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:23:49,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:49,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:23:49,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-11 14:23:49,926 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-11 14:23:49,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:49,949 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-11 14:23:49,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:49,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:23:49,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:49,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:23:49,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:23:49,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:23:49,969 INFO L87 Difference]: Start difference. First operand 125 states and 745 transitions. Second operand 7 states. [2019-01-11 14:23:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:50,273 INFO L93 Difference]: Finished difference Result 158 states and 796 transitions. [2019-01-11 14:23:50,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:23:50,273 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-01-11 14:23:50,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:50,276 INFO L225 Difference]: With dead ends: 158 [2019-01-11 14:23:50,276 INFO L226 Difference]: Without dead ends: 156 [2019-01-11 14:23:50,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-01-11 14:23:50,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2019-01-11 14:23:50,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-11 14:23:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 760 transitions. [2019-01-11 14:23:50,304 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 760 transitions. Word has length 5 [2019-01-11 14:23:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:50,305 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 760 transitions. [2019-01-11 14:23:50,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:23:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 760 transitions. [2019-01-11 14:23:50,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:50,306 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:50,306 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:50,306 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:50,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:50,306 INFO L82 PathProgramCache]: Analyzing trace with hash 28831546, now seen corresponding path program 2 times [2019-01-11 14:23:50,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:50,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:50,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:50,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:50,307 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:50,499 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-11 14:23:50,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:50,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:50,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:23:50,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:23:50,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:50,501 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:50,512 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:23:50,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:23:50,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:23:50,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:23:50,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:50,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,553 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-11 14:23:50,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,598 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-11 14:23:50,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:23:50,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,698 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,700 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-11 14:23:50,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:50,785 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-11 14:23:50,786 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,813 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,840 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,932 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 21 treesize of output 24 [2019-01-11 14:23:50,935 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 24 treesize of output 30 [2019-01-11 14:23:50,938 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 26 treesize of output 40 [2019-01-11 14:23:50,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:50,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:23:50,948 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:23:50,949 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:50,984 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:51,004 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:51,021 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:51,033 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:51,045 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:51,092 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-11 14:23:51,092 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 14:23:51,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,118 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-11 14:23:51,119 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:51,164 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-11 14:23:51,164 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:23:51,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,199 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-11 14:23:51,200 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:51,257 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-11 14:23:51,258 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-11 14:23:51,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:51,298 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:51,299 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-11 14:23:51,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:51,349 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-11 14:23:51,350 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 14:23:51,370 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-11 14:23:51,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:51,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:51,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2019-01-11 14:23:51,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:51,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:51,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:51,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:23:51,413 INFO L87 Difference]: Start difference. First operand 128 states and 760 transitions. Second operand 10 states. [2019-01-11 14:23:52,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:52,130 INFO L93 Difference]: Finished difference Result 241 states and 1191 transitions. [2019-01-11 14:23:52,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:23:52,130 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:23:52,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:52,134 INFO L225 Difference]: With dead ends: 241 [2019-01-11 14:23:52,134 INFO L226 Difference]: Without dead ends: 235 [2019-01-11 14:23:52,135 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:23:52,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2019-01-11 14:23:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 164. [2019-01-11 14:23:52,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-01-11 14:23:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 1007 transitions. [2019-01-11 14:23:52,173 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 1007 transitions. Word has length 5 [2019-01-11 14:23:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:52,173 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 1007 transitions. [2019-01-11 14:23:52,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:23:52,173 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 1007 transitions. [2019-01-11 14:23:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:52,174 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:52,174 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:52,175 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:52,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:52,175 INFO L82 PathProgramCache]: Analyzing trace with hash 28831858, now seen corresponding path program 1 times [2019-01-11 14:23:52,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:52,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:52,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:23:52,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:52,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:52,557 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-11 14:23:52,557 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:52,557 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:52,557 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:52,558 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [29] [2019-01-11 14:23:52,558 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:52,559 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:52,561 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:52,561 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:23:52,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:52,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:52,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:52,562 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:52,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:52,579 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:52,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:52,589 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:52,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:23:52,615 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 24 treesize of output 30 [2019-01-11 14:23:52,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,622 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 26 treesize of output 40 [2019-01-11 14:23:52,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,629 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 28 treesize of output 54 [2019-01-11 14:23:52,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:23:52,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:52,647 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,687 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,711 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,748 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:52,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:52,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:52,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:52,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:52,936 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,959 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,975 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:52,991 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:53,026 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-11 14:23:53,026 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:53,286 WARN L181 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-11 14:23:53,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,446 INFO L303 Elim1Store]: Index analysis took 156 ms [2019-01-11 14:23:53,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 14:23:53,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:53,567 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-11 14:23:53,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:106 [2019-01-11 14:23:53,793 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-11 14:23:53,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,811 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:53,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-11 14:23:53,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:53,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:53,935 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 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-11 14:23:53,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-11 14:23:54,332 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-11 14:23:54,333 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:126, output treesize:280 [2019-01-11 14:23:54,572 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 90 [2019-01-11 14:23:54,577 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:54,577 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:54,664 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-11 14:23:54,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:54,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:23:54,684 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:54,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:23:54,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:23:54,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:23:54,685 INFO L87 Difference]: Start difference. First operand 164 states and 1007 transitions. Second operand 8 states. [2019-01-11 14:23:55,183 WARN L181 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-11 14:23:55,719 WARN L181 SmtUtils]: Spent 492.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2019-01-11 14:23:56,302 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-01-11 14:23:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:23:56,669 INFO L93 Difference]: Finished difference Result 208 states and 1150 transitions. [2019-01-11 14:23:56,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:23:56,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:23:56,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:23:56,672 INFO L225 Difference]: With dead ends: 208 [2019-01-11 14:23:56,673 INFO L226 Difference]: Without dead ends: 207 [2019-01-11 14:23:56,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:23:56,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-11 14:23:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2019-01-11 14:23:56,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-11 14:23:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 1128 transitions. [2019-01-11 14:23:56,707 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 1128 transitions. Word has length 5 [2019-01-11 14:23:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:23:56,707 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 1128 transitions. [2019-01-11 14:23:56,707 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:23:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 1128 transitions. [2019-01-11 14:23:56,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:23:56,708 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:23:56,708 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:23:56,709 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:23:56,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:56,709 INFO L82 PathProgramCache]: Analyzing trace with hash 28818278, now seen corresponding path program 1 times [2019-01-11 14:23:56,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:23:56,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:56,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:56,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:23:56,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:23:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:56,882 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-11 14:23:56,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:56,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:23:56,883 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:23:56,884 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [27] [2019-01-11 14:23:56,885 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:23:56,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:23:56,887 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:23:56,887 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:23:56,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:23:56,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:23:56,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:23:56,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:23:56,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:23:56,896 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:23:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:23:56,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:23:56,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:56,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:23:56,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:56,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:56,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:23:56,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:23:57,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:23:57,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,067 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,083 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,101 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:23:57,128 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 24 treesize of output 30 [2019-01-11 14:23:57,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:23:57,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:23:57,138 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 30 treesize of output 72 [2019-01-11 14:23:57,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:23:57,148 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,174 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,195 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,212 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,225 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,237 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:23:57,271 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-11 14:23:57,271 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:23:57,536 WARN L181 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-11 14:23:57,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 14:23:57,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:57,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-11 14:23:57,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-11 14:23:57,904 WARN L181 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-11 14:23:57,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:57,931 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 2 case distinctions, treesize of input 65 treesize of output 103 [2019-01-11 14:23:57,932 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:23:58,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 89 [2019-01-11 14:23:58,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-11 14:23:58,197 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:129, output treesize:125 [2019-01-11 14:23:58,434 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-11 14:23:58,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,479 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:58,506 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 6 case distinctions, treesize of input 55 treesize of output 118 [2019-01-11 14:23:58,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 14:23:58,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,824 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:23:58,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-11 14:23:58,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:58,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:58,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:23:59,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 110 [2019-01-11 14:23:59,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:23:59,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-11 14:23:59,189 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:242 [2019-01-11 14:23:59,321 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-11 14:23:59,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:23:59,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:23:59,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:23:59,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:23:59,378 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:23:59,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:23:59,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:23:59,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:23:59,378 INFO L87 Difference]: Start difference. First operand 181 states and 1128 transitions. Second operand 10 states. [2019-01-11 14:24:00,360 WARN L181 SmtUtils]: Spent 476.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 84 [2019-01-11 14:24:00,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:00,924 INFO L93 Difference]: Finished difference Result 280 states and 1534 transitions. [2019-01-11 14:24:00,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:24:00,925 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:24:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:00,929 INFO L225 Difference]: With dead ends: 280 [2019-01-11 14:24:00,929 INFO L226 Difference]: Without dead ends: 279 [2019-01-11 14:24:00,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:24:00,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-11 14:24:00,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 185. [2019-01-11 14:24:00,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-01-11 14:24:00,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 1156 transitions. [2019-01-11 14:24:00,975 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 1156 transitions. Word has length 5 [2019-01-11 14:24:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:00,975 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 1156 transitions. [2019-01-11 14:24:00,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:00,976 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 1156 transitions. [2019-01-11 14:24:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:00,977 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:00,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:00,977 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:00,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:00,977 INFO L82 PathProgramCache]: Analyzing trace with hash 28835766, now seen corresponding path program 1 times [2019-01-11 14:24:00,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:00,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:00,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:00,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:00,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:01,046 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-11 14:24:01,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:24:01,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-11 14:24:01,047 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:24:01,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:24:01,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:24:01,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-11 14:24:01,048 INFO L87 Difference]: Start difference. First operand 185 states and 1156 transitions. Second operand 4 states. [2019-01-11 14:24:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:01,150 INFO L93 Difference]: Finished difference Result 201 states and 1179 transitions. [2019-01-11 14:24:01,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:24:01,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-11 14:24:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:01,154 INFO L225 Difference]: With dead ends: 201 [2019-01-11 14:24:01,154 INFO L226 Difference]: Without dead ends: 198 [2019-01-11 14:24:01,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 14:24:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-11 14:24:01,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 187. [2019-01-11 14:24:01,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-01-11 14:24:01,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 1164 transitions. [2019-01-11 14:24:01,200 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 1164 transitions. Word has length 5 [2019-01-11 14:24:01,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:01,200 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 1164 transitions. [2019-01-11 14:24:01,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:24:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 1164 transitions. [2019-01-11 14:24:01,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:01,202 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:01,202 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:01,202 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:01,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:01,202 INFO L82 PathProgramCache]: Analyzing trace with hash 28822248, now seen corresponding path program 1 times [2019-01-11 14:24:01,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:01,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:01,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:01,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:01,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:01,604 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-11 14:24:01,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:01,605 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:01,605 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:24:01,605 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [29] [2019-01-11 14:24:01,606 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:01,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:01,609 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:01,609 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:24:01,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:01,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:01,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:01,610 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:01,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:01,629 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:01,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:01,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:24:01,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,719 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:24:01,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,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 32 treesize of output 61 [2019-01-11 14:24:01,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:01,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:24:01,815 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:01,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:01,858 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:01,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:01,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:01,919 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 24 treesize of output 30 [2019-01-11 14:24:01,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:24:01,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:24:01,932 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 30 treesize of output 72 [2019-01-11 14:24:01,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:24:01,940 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:01,965 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:01,985 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,001 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,013 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,025 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,056 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-11 14:24:02,056 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:24:02,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:24:02,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,123 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-11 14:24:02,123 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:24:02,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,152 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:02,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:24:02,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,184 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-11 14:24:02,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:60, output treesize:42 [2019-01-11 14:24:02,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-11 14:24:02,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:02,223 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-11 14:24:02,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:02,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:24:02,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:02,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:24:02,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:24:02,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:02,243 INFO L87 Difference]: Start difference. First operand 187 states and 1164 transitions. Second operand 8 states. [2019-01-11 14:24:02,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:02,576 INFO L93 Difference]: Finished difference Result 208 states and 1202 transitions. [2019-01-11 14:24:02,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:24:02,576 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:24:02,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:02,579 INFO L225 Difference]: With dead ends: 208 [2019-01-11 14:24:02,579 INFO L226 Difference]: Without dead ends: 207 [2019-01-11 14:24:02,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:24:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-01-11 14:24:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2019-01-11 14:24:02,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-01-11 14:24:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 1178 transitions. [2019-01-11 14:24:02,618 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 1178 transitions. Word has length 5 [2019-01-11 14:24:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:02,618 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 1178 transitions. [2019-01-11 14:24:02,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:24:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 1178 transitions. [2019-01-11 14:24:02,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:02,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:02,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:02,619 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:02,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:02,620 INFO L82 PathProgramCache]: Analyzing trace with hash 29302748, now seen corresponding path program 1 times [2019-01-11 14:24:02,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:02,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:02,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:02,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:02,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:02,716 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-11 14:24:02,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:02,716 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:02,717 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:24:02,717 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [29] [2019-01-11 14:24:02,718 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:02,718 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:02,721 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:02,721 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:24:02,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:02,722 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:02,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:02,722 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:02,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:02,731 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:02,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:02,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:02,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:24:02,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,762 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,763 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:24:02,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:24:02,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:02,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:24:02,870 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,890 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,911 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:02,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:02,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:24:02,989 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:24:02,992 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:24:02,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:24:03,009 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:24:03,009 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:03,033 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:03,052 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:03,064 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:03,076 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:03,089 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:03,120 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-11 14:24:03,120 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 14:24:03,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:24:03,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:03,187 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-11 14:24:03,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:24:03,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 74 [2019-01-11 14:24:03,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:03,250 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-11 14:24:03,251 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:34 [2019-01-11 14:24:03,270 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-11 14:24:03,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:03,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:03,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:24:03,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:03,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:24:03,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:24:03,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:03,315 INFO L87 Difference]: Start difference. First operand 189 states and 1178 transitions. Second operand 8 states. [2019-01-11 14:24:03,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:03,620 INFO L93 Difference]: Finished difference Result 210 states and 1196 transitions. [2019-01-11 14:24:03,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:24:03,620 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:24:03,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:03,623 INFO L225 Difference]: With dead ends: 210 [2019-01-11 14:24:03,624 INFO L226 Difference]: Without dead ends: 208 [2019-01-11 14:24:03,624 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-11 14:24:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-01-11 14:24:03,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 191. [2019-01-11 14:24:03,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-11 14:24:03,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 1179 transitions. [2019-01-11 14:24:03,666 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 1179 transitions. Word has length 5 [2019-01-11 14:24:03,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:03,666 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 1179 transitions. [2019-01-11 14:24:03,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:24:03,666 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 1179 transitions. [2019-01-11 14:24:03,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:03,667 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:03,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:03,667 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:03,667 INFO L82 PathProgramCache]: Analyzing trace with hash 29308202, now seen corresponding path program 2 times [2019-01-11 14:24:03,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:03,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:03,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:03,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:03,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:03,742 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-11 14:24:03,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:03,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:03,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:03,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:03,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:03,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:03,753 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:24:03,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:24:03,760 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:24:03,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:03,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:03,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,798 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-11 14:24:03,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,845 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-11 14:24:03,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,893 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-11 14:24:03,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:03,955 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-11 14:24:04,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,041 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-11 14:24:04,042 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,078 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,142 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,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, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:04,219 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 24 treesize of output 30 [2019-01-11 14:24:04,231 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 26 treesize of output 40 [2019-01-11 14:24:04,248 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 28 treesize of output 54 [2019-01-11 14:24:04,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:24:04,262 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:24:04,263 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,649 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,670 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,686 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,698 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,711 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:04,759 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:24:04,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,798 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-11 14:24:04,798 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,845 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-11 14:24:04,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:24:04,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,885 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-11 14:24:04,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:04,936 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-11 14:24:04,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-11 14:24:04,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,971 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,978 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:04,980 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:04,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, 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 124 [2019-01-11 14:24:04,982 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:05,036 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-11 14:24:05,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 14:24:05,058 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-11 14:24:05,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:05,100 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-11 14:24:05,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:05,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:05,119 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:05,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:05,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:05,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:05,120 INFO L87 Difference]: Start difference. First operand 191 states and 1179 transitions. Second operand 10 states. [2019-01-11 14:24:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:06,635 INFO L93 Difference]: Finished difference Result 242 states and 1308 transitions. [2019-01-11 14:24:06,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:06,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:24:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:06,638 INFO L225 Difference]: With dead ends: 242 [2019-01-11 14:24:06,638 INFO L226 Difference]: Without dead ends: 240 [2019-01-11 14:24:06,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:06,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-01-11 14:24:06,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 202. [2019-01-11 14:24:06,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-01-11 14:24:06,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 1251 transitions. [2019-01-11 14:24:06,686 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 1251 transitions. Word has length 5 [2019-01-11 14:24:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:06,686 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 1251 transitions. [2019-01-11 14:24:06,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 1251 transitions. [2019-01-11 14:24:06,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:06,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:06,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:06,688 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:06,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:06,689 INFO L82 PathProgramCache]: Analyzing trace with hash 29307954, now seen corresponding path program 1 times [2019-01-11 14:24:06,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:06,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:06,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:06,690 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:06,762 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-11 14:24:06,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:06,763 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:06,763 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:24:06,763 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [27] [2019-01-11 14:24:06,764 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:06,764 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:06,766 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:06,767 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:24:06,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:06,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:06,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:06,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:06,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:06,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:06,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:06,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:06,815 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 24 treesize of output 30 [2019-01-11 14:24:06,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:24:06,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,839 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 28 treesize of output 54 [2019-01-11 14:24:06,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,846 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 30 treesize of output 72 [2019-01-11 14:24:06,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:06,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:24:06,857 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:06,899 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:06,920 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:06,939 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:06,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:06,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,002 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-11 14:24:07,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:24:07,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 14:24:07,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,143 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-11 14:24:07,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,216 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-11 14:24:07,217 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,243 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,270 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,296 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,354 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,399 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:07,399 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:24:07,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,437 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-11 14:24:07,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,484 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-11 14:24:07,484 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:24:07,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,519 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-11 14:24:07,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,567 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-11 14:24:07,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:55 [2019-01-11 14:24:07,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:07,607 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:07,608 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 134 [2019-01-11 14:24:07,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:07,663 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-11 14:24:07,663 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 14:24:07,684 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-11 14:24:07,685 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:07,720 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-11 14:24:07,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:07,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:07,740 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:07,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:07,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:07,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:07,740 INFO L87 Difference]: Start difference. First operand 202 states and 1251 transitions. Second operand 10 states. [2019-01-11 14:24:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:08,345 INFO L93 Difference]: Finished difference Result 249 states and 1369 transitions. [2019-01-11 14:24:08,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:08,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:24:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:08,349 INFO L225 Difference]: With dead ends: 249 [2019-01-11 14:24:08,349 INFO L226 Difference]: Without dead ends: 247 [2019-01-11 14:24:08,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:08,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-01-11 14:24:08,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 212. [2019-01-11 14:24:08,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-01-11 14:24:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 1326 transitions. [2019-01-11 14:24:08,382 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 1326 transitions. Word has length 5 [2019-01-11 14:24:08,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:08,382 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 1326 transitions. [2019-01-11 14:24:08,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 1326 transitions. [2019-01-11 14:24:08,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:08,383 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:08,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:08,383 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:08,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:08,384 INFO L82 PathProgramCache]: Analyzing trace with hash 29294624, now seen corresponding path program 1 times [2019-01-11 14:24:08,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:08,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:08,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:08,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:08,385 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:08,554 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-11 14:24:08,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:08,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:08,555 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:24:08,555 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [27] [2019-01-11 14:24:08,557 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:08,557 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:08,559 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:08,559 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:24:08,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:08,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:08,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:08,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:08,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:08,569 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:08,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:08,610 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 21 treesize of output 24 [2019-01-11 14:24:08,612 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 24 treesize of output 30 [2019-01-11 14:24:08,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,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 26 treesize of output 40 [2019-01-11 14:24:08,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:24:08,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:24:08,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:24:08,640 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,670 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,693 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,712 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:24:08,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:24:08,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:24:08,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:08,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:24:08,896 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,947 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,964 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:08,981 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:09,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:09,017 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 14:24:09,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:24:09,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:09,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:09,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:24:09,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:24:09,158 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:09,204 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-11 14:24:09,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-11 14:24:09,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:09,241 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:09,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:24:09,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:09,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:09,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 14:24:09,298 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-11 14:24:09,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:09,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:09,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:09,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:09,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:09,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:09,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:09,363 INFO L87 Difference]: Start difference. First operand 212 states and 1326 transitions. Second operand 10 states. [2019-01-11 14:24:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:09,953 INFO L93 Difference]: Finished difference Result 260 states and 1437 transitions. [2019-01-11 14:24:09,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:09,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:24:09,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:09,957 INFO L225 Difference]: With dead ends: 260 [2019-01-11 14:24:09,957 INFO L226 Difference]: Without dead ends: 258 [2019-01-11 14:24:09,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:24:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2019-01-11 14:24:09,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 221. [2019-01-11 14:24:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 14:24:09,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-11 14:24:09,999 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-11 14:24:09,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:09,999 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-11 14:24:09,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:09,999 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-11 14:24:10,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:10,000 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:10,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:10,000 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:10,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:10,001 INFO L82 PathProgramCache]: Analyzing trace with hash 29298904, now seen corresponding path program 1 times [2019-01-11 14:24:10,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:10,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:10,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:10,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:10,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:10,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:10,070 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-11 14:24:10,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:10,070 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:10,070 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:24:10,070 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [29] [2019-01-11 14:24:10,072 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:10,072 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:10,075 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:10,075 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:24:10,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:10,076 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:10,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:10,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:10,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:10,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:10,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:10,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:10,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:24:10,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,137 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 26 treesize of output 36 [2019-01-11 14:24:10,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,146 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:24:10,151 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:24:10,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:24:10,168 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,231 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,253 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,268 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,282 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,296 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:24:10,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,343 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 53 treesize of output 63 [2019-01-11 14:24:10,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:24:10,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:24:10,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,495 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:24:10,504 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,529 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,553 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,578 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,605 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,648 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-11 14:24:10,649 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 14:24:10,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,676 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 41 treesize of output 93 [2019-01-11 14:24:10,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,718 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-11 14:24:10,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 14:24:10,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:10,747 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:10,748 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 41 treesize of output 101 [2019-01-11 14:24:10,749 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:10,791 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-11 14:24:10,792 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:55 [2019-01-11 14:24:10,811 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-11 14:24:10,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:10,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:10,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:24:10,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:10,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:24:10,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:24:10,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:10,849 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-11 14:24:11,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:11,163 INFO L93 Difference]: Finished difference Result 244 states and 1417 transitions. [2019-01-11 14:24:11,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:24:11,164 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:24:11,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:11,167 INFO L225 Difference]: With dead ends: 244 [2019-01-11 14:24:11,167 INFO L226 Difference]: Without dead ends: 243 [2019-01-11 14:24:11,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:24:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-01-11 14:24:11,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 221. [2019-01-11 14:24:11,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-11 14:24:11,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 1389 transitions. [2019-01-11 14:24:11,215 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 1389 transitions. Word has length 5 [2019-01-11 14:24:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:11,216 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 1389 transitions. [2019-01-11 14:24:11,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:24:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 1389 transitions. [2019-01-11 14:24:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:11,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:11,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:11,217 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:11,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:11,218 INFO L82 PathProgramCache]: Analyzing trace with hash 29366174, now seen corresponding path program 1 times [2019-01-11 14:24:11,218 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:11,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:11,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:11,219 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:11,384 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-11 14:24:11,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:11,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:11,385 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:24:11,385 INFO L207 CegarAbsIntRunner]: [0], [22], [24], [28], [29] [2019-01-11 14:24:11,386 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:11,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:11,389 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:11,389 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:24:11,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:11,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:11,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:11,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:11,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:11,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:11,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:11,407 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:11,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:24:11,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,425 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 26 treesize of output 36 [2019-01-11 14:24:11,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,439 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 28 treesize of output 50 [2019-01-11 14:24:11,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:24:11,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:24:11,461 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,487 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,509 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,522 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,536 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,549 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:24:11,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,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 36 treesize of output 49 [2019-01-11 14:24:11,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:24:11,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:11,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:24:11,678 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,693 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,708 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,724 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:11,755 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-11 14:24:11,756 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 14:24:11,970 WARN L181 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-11 14:24:11,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 14:24:12,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-11 14:24:12,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-11 14:24:12,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:389 [2019-01-11 14:24:12,763 WARN L181 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 82 [2019-01-11 14:24:12,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-11 14:24:12,776 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:12,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 71 [2019-01-11 14:24:12,877 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:12,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:12,959 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:12,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 80 [2019-01-11 14:24:12,960 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:13,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-11 14:24:13,027 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:178, output treesize:126 [2019-01-11 14:24:13,106 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-11 14:24:13,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:13,145 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-11 14:24:13,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:13,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:24:13,163 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:13,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:24:13,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:24:13,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:13,163 INFO L87 Difference]: Start difference. First operand 221 states and 1389 transitions. Second operand 8 states. [2019-01-11 14:24:13,584 WARN L181 SmtUtils]: Spent 406.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-11 14:24:13,945 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-01-11 14:24:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:24,520 INFO L93 Difference]: Finished difference Result 273 states and 1446 transitions. [2019-01-11 14:24:24,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:24:24,521 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:24:24,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:24,523 INFO L225 Difference]: With dead ends: 273 [2019-01-11 14:24:24,523 INFO L226 Difference]: Without dead ends: 272 [2019-01-11 14:24:24,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:24:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-01-11 14:24:24,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2019-01-11 14:24:24,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-11 14:24:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 1396 transitions. [2019-01-11 14:24:24,560 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 1396 transitions. Word has length 5 [2019-01-11 14:24:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:24,560 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 1396 transitions. [2019-01-11 14:24:24,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:24:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 1396 transitions. [2019-01-11 14:24:24,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:24,561 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:24,561 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:24,561 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:24,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:24,561 INFO L82 PathProgramCache]: Analyzing trace with hash 29353958, now seen corresponding path program 2 times [2019-01-11 14:24:24,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:24,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:24,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:24,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:24,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:24,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:24,712 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:24,712 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:24,713 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:24,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:24,713 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:24,721 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:24:24,722 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:24:24,728 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:24:24,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:24,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:24,764 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 21 treesize of output 24 [2019-01-11 14:24:24,767 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 24 treesize of output 30 [2019-01-11 14:24:24,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,772 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 26 treesize of output 40 [2019-01-11 14:24:24,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,779 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,779 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 28 treesize of output 54 [2019-01-11 14:24:24,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,787 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 30 treesize of output 72 [2019-01-11 14:24:24,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:24:24,804 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,844 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,866 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,885 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,901 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,915 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:24,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:24:24,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:24,989 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-11 14:24:25,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:25,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,089 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,096 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-11 14:24:25,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,177 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-11 14:24:25,177 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,204 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,232 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,259 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,288 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,339 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-11 14:24:25,339 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 14:24:25,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,372 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-11 14:24:25,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,423 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-11 14:24:25,424 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 14:24:25,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,462 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:25,463 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-11 14:24:25,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,515 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-11 14:24:25,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:83, output treesize:59 [2019-01-11 14:24:25,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:25,559 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 45 treesize of output 115 [2019-01-11 14:24:25,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:25,611 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-11 14:24:25,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-11 14:24:25,631 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-11 14:24:25,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:25,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:25,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:24:25,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:25,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:25,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:25,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:24:25,674 INFO L87 Difference]: Start difference. First operand 222 states and 1396 transitions. Second operand 10 states. [2019-01-11 14:24:26,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:26,453 INFO L93 Difference]: Finished difference Result 274 states and 1519 transitions. [2019-01-11 14:24:26,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:24:26,454 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:24:26,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:26,458 INFO L225 Difference]: With dead ends: 274 [2019-01-11 14:24:26,458 INFO L226 Difference]: Without dead ends: 273 [2019-01-11 14:24:26,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:26,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-11 14:24:26,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 225. [2019-01-11 14:24:26,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 14:24:26,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-11 14:24:26,495 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-11 14:24:26,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:26,495 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-11 14:24:26,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:26,496 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-11 14:24:26,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:26,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:26,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:26,496 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:26,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:26,497 INFO L82 PathProgramCache]: Analyzing trace with hash 29372004, now seen corresponding path program 1 times [2019-01-11 14:24:26,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:26,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:26,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:26,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:26,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:26,657 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-11 14:24:26,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:26,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:26,658 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:24:26,658 INFO L207 CegarAbsIntRunner]: [0], [24], [28], [30], [31] [2019-01-11 14:24:26,659 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:26,659 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:26,662 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:26,662 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:24:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:26,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:26,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:26,663 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:26,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:26,674 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:26,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:26,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:24:26,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,714 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 53 treesize of output 63 [2019-01-11 14:24:26,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:24:26,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:24:26,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,876 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:26,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:24:26,886 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:26,911 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:26,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:26,963 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:26,992 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:27,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:27,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:24:27,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:24:27,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:24:27,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:24:27,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:24:27,047 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:27,081 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:27,101 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:27,115 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:27,126 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:27,138 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:27,183 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-11 14:24:27,184 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-11 14:24:27,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:27,208 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 41 treesize of output 93 [2019-01-11 14:24:27,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:27,256 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-11 14:24:27,256 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:97, output treesize:67 [2019-01-11 14:24:27,272 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-11 14:24:27,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:27,282 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-11 14:24:27,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:27,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-01-11 14:24:27,302 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:27,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-11 14:24:27,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-11 14:24:27,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-11 14:24:27,302 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 6 states. [2019-01-11 14:24:27,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:27,513 INFO L93 Difference]: Finished difference Result 242 states and 1433 transitions. [2019-01-11 14:24:27,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-11 14:24:27,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2019-01-11 14:24:27,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:27,516 INFO L225 Difference]: With dead ends: 242 [2019-01-11 14:24:27,516 INFO L226 Difference]: Without dead ends: 241 [2019-01-11 14:24:27,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 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-11 14:24:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-01-11 14:24:27,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 225. [2019-01-11 14:24:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-01-11 14:24:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 1417 transitions. [2019-01-11 14:24:27,561 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 1417 transitions. Word has length 5 [2019-01-11 14:24:27,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:27,561 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 1417 transitions. [2019-01-11 14:24:27,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-11 14:24:27,561 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 1417 transitions. [2019-01-11 14:24:27,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:27,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:27,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:27,562 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:27,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:27,563 INFO L82 PathProgramCache]: Analyzing trace with hash 29357926, now seen corresponding path program 1 times [2019-01-11 14:24:27,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:27,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:27,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:27,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:27,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:27,822 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 19 [2019-01-11 14:24:27,854 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-11 14:24:27,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:27,855 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:27,855 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:24:27,855 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [24], [27] [2019-01-11 14:24:27,856 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:27,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:27,858 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:27,858 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:24:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:27,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:27,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:27,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:27,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:27,867 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:27,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:27,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:27,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:24:27,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:27,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:27,939 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-11 14:24:27,984 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:27,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:27,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:27,986 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:27,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:28,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,047 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-11 14:24:28,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,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-11 14:24:28,122 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,148 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,175 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,202 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,228 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,265 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 21 treesize of output 24 [2019-01-11 14:24:28,268 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 24 treesize of output 30 [2019-01-11 14:24:28,270 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 26 treesize of output 40 [2019-01-11 14:24:28,274 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 28 treesize of output 54 [2019-01-11 14:24:28,277 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 30 treesize of output 72 [2019-01-11 14:24:28,281 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:24:28,282 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,316 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,337 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,354 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,368 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,380 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:28,427 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:24:28,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,462 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-11 14:24:28,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:28,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:24:28,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,547 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-11 14:24:28,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,595 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-11 14:24:28,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 14:24:28,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,629 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,632 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:28,634 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:28,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, 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 128 [2019-01-11 14:24:28,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:28,688 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-11 14:24:28,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:47 [2019-01-11 14:24:28,710 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-11 14:24:28,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:28,764 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-11 14:24:28,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:28,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:28,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:28,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:28,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:28,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:28,784 INFO L87 Difference]: Start difference. First operand 225 states and 1417 transitions. Second operand 10 states. [2019-01-11 14:24:29,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:29,467 INFO L93 Difference]: Finished difference Result 276 states and 1527 transitions. [2019-01-11 14:24:29,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:29,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 5 [2019-01-11 14:24:29,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:29,472 INFO L225 Difference]: With dead ends: 276 [2019-01-11 14:24:29,472 INFO L226 Difference]: Without dead ends: 274 [2019-01-11 14:24:29,473 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-11 14:24:29,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-11 14:24:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 234. [2019-01-11 14:24:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-01-11 14:24:29,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 1480 transitions. [2019-01-11 14:24:29,523 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 1480 transitions. Word has length 5 [2019-01-11 14:24:29,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:29,523 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 1480 transitions. [2019-01-11 14:24:29,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 1480 transitions. [2019-01-11 14:24:29,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:29,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:29,524 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:29,524 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:29,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash 28933724, now seen corresponding path program 1 times [2019-01-11 14:24:29,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:29,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:29,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:29,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:29,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:29,766 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-11 14:24:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:29,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:29,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:29,831 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:24:29,831 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [29] [2019-01-11 14:24:29,832 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:29,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:29,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:29,835 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:24:29,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:29,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:29,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:29,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:29,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:29,850 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:29,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:29,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:24:29,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:24:29,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:29,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:24:30,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:24:30,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,031 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,048 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,090 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 21 treesize of output 24 [2019-01-11 14:24:30,093 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 24 treesize of output 30 [2019-01-11 14:24:30,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:24:30,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:24:30,104 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 30 treesize of output 72 [2019-01-11 14:24:30,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:24:30,114 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,141 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,161 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,177 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,190 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,201 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,235 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-11 14:24:30,236 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 14:24:30,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:24:30,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,304 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-11 14:24:30,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:24:30,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:30,500 INFO L303 Elim1Store]: Index analysis took 182 ms [2019-01-11 14:24:30,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:24:30,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:30,716 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-11 14:24:30,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:62, output treesize:40 [2019-01-11 14:24:30,733 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-11 14:24:30,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:30,753 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-11 14:24:30,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:30,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:24:30,771 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:30,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:24:30,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:24:30,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:30,772 INFO L87 Difference]: Start difference. First operand 234 states and 1480 transitions. Second operand 8 states. [2019-01-11 14:24:31,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:31,172 INFO L93 Difference]: Finished difference Result 288 states and 1635 transitions. [2019-01-11 14:24:31,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:31,172 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:24:31,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:31,176 INFO L225 Difference]: With dead ends: 288 [2019-01-11 14:24:31,176 INFO L226 Difference]: Without dead ends: 287 [2019-01-11 14:24:31,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:24:31,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-01-11 14:24:31,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 250. [2019-01-11 14:24:31,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-01-11 14:24:31,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 1595 transitions. [2019-01-11 14:24:31,233 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 1595 transitions. Word has length 5 [2019-01-11 14:24:31,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:31,233 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 1595 transitions. [2019-01-11 14:24:31,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:24:31,233 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 1595 transitions. [2019-01-11 14:24:31,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-11 14:24:31,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:31,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-11 14:24:31,234 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:31,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:31,234 INFO L82 PathProgramCache]: Analyzing trace with hash 28941412, now seen corresponding path program 1 times [2019-01-11 14:24:31,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:31,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:31,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:31,236 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:31,304 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-11 14:24:31,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:31,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:31,304 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-01-11 14:24:31,305 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [28], [29] [2019-01-11 14:24:31,305 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:31,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:31,307 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:31,307 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:24:31,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:31,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:31,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:31,308 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:31,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:31,319 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:31,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:31,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:31,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:24:31,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,346 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:24:31,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,359 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 28 treesize of output 50 [2019-01-11 14:24:31,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,373 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:24:31,386 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:24:31,386 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,412 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,432 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,462 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:24:31,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,515 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:24:31,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:24:31,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:24:31,598 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,614 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,628 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,644 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,675 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-11 14:24:31,676 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-11 14:24:31,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,714 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:24:31,715 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:24:31,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:24:31,810 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:92 [2019-01-11 14:24:31,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:31,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 67 [2019-01-11 14:24:31,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:31,866 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-11 14:24:31,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:27 [2019-01-11 14:24:31,880 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-11 14:24:31,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:31,892 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-11 14:24:31,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:31,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:24:31,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:31,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:24:31,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:24:31,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:24:31,911 INFO L87 Difference]: Start difference. First operand 250 states and 1595 transitions. Second operand 8 states. [2019-01-11 14:24:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:32,310 INFO L93 Difference]: Finished difference Result 319 states and 1823 transitions. [2019-01-11 14:24:32,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:24:32,310 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2019-01-11 14:24:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:32,315 INFO L225 Difference]: With dead ends: 319 [2019-01-11 14:24:32,315 INFO L226 Difference]: Without dead ends: 318 [2019-01-11 14:24:32,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:32,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2019-01-11 14:24:32,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 276. [2019-01-11 14:24:32,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 14:24:32,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-11 14:24:32,371 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 5 [2019-01-11 14:24:32,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:32,372 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-11 14:24:32,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:24:32,372 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-11 14:24:32,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:32,373 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:32,373 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:24:32,373 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:32,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:32,373 INFO L82 PathProgramCache]: Analyzing trace with hash 904691166, now seen corresponding path program 1 times [2019-01-11 14:24:32,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:32,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:32,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:32,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:32,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:32,403 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-11 14:24:32,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:32,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:32,403 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:24:32,404 INFO L207 CegarAbsIntRunner]: [0], [18], [28], [30], [31] [2019-01-11 14:24:32,405 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:32,405 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:32,407 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:32,407 INFO L272 AbstractInterpreter]: Visited 5 different actions 5 times. Never merged. Never widened. Performed 68 root evaluator evaluations with a maximum evaluation depth of 2. Performed 68 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-11 14:24:32,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:32,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:32,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:32,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:32,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:32,418 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:32,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:32,425 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:32,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:24:32,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:24:32,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,508 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:24:32,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:24:32,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,582 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,604 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,630 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:32,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:24:32,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:24:32,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:24:32,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:24:32,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:24:32,687 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,712 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,731 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,747 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,758 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,770 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,801 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-11 14:24:32,802 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-11 14:24:32,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 14:24:32,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,888 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-11 14:24:32,889 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:24:32,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:32,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 74 [2019-01-11 14:24:32,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:32,944 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-11 14:24:32,944 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-11 14:24:32,961 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-11 14:24:32,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:32,977 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-11 14:24:32,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:32,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:24:32,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:32,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:24:32,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:24:32,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:24:32,996 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 7 states. [2019-01-11 14:24:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:33,207 INFO L93 Difference]: Finished difference Result 290 states and 1801 transitions. [2019-01-11 14:24:33,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:24:33,207 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-01-11 14:24:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:33,211 INFO L225 Difference]: With dead ends: 290 [2019-01-11 14:24:33,211 INFO L226 Difference]: Without dead ends: 289 [2019-01-11 14:24:33,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-11 14:24:33,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 276. [2019-01-11 14:24:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-11 14:24:33,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 1782 transitions. [2019-01-11 14:24:33,261 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 1782 transitions. Word has length 6 [2019-01-11 14:24:33,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:33,261 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 1782 transitions. [2019-01-11 14:24:33,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:24:33,261 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 1782 transitions. [2019-01-11 14:24:33,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:33,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:33,262 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-11 14:24:33,263 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:33,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:33,263 INFO L82 PathProgramCache]: Analyzing trace with hash 904323688, now seen corresponding path program 3 times [2019-01-11 14:24:33,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:33,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:33,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:33,264 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:33,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:33,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:33,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:33,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:33,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:33,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:33,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:33,426 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:33,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:24:33,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:24:33,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:24:33,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:33,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:33,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:33,466 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 24 treesize of output 30 [2019-01-11 14:24:33,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,470 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 26 treesize of output 40 [2019-01-11 14:24:33,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:24:33,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,485 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 30 treesize of output 72 [2019-01-11 14:24:33,499 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:24:33,500 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,529 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,552 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,570 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:24:33,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:24:33,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,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 32 treesize of output 61 [2019-01-11 14:24:33,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,759 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:24:33,763 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,780 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,796 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,812 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,846 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-11 14:24:33,846 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:72, output treesize:71 [2019-01-11 14:24:33,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:24:33,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,910 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-11 14:24:33,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:24:33,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:24:33,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:33,977 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-11 14:24:33,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 14:24:33,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:33,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:24:34,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:34,047 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-11 14:24:34,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2019-01-11 14:24:34,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:34,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:24:34,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:34,129 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-11 14:24:34,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:38 [2019-01-11 14:24:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:34,146 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:34,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:34,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 14:24:34,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:34,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:24:34,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:24:34,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:24:34,198 INFO L87 Difference]: Start difference. First operand 276 states and 1782 transitions. Second operand 11 states. [2019-01-11 14:24:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:34,802 INFO L93 Difference]: Finished difference Result 423 states and 2543 transitions. [2019-01-11 14:24:34,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:24:34,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 14:24:34,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:34,809 INFO L225 Difference]: With dead ends: 423 [2019-01-11 14:24:34,810 INFO L226 Difference]: Without dead ends: 421 [2019-01-11 14:24:34,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:34,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-11 14:24:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 325. [2019-01-11 14:24:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2019-01-11 14:24:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 2130 transitions. [2019-01-11 14:24:34,930 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 2130 transitions. Word has length 6 [2019-01-11 14:24:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:34,931 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 2130 transitions. [2019-01-11 14:24:34,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:24:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 2130 transitions. [2019-01-11 14:24:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:34,933 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:34,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:24:34,933 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:34,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:34,933 INFO L82 PathProgramCache]: Analyzing trace with hash 904327844, now seen corresponding path program 1 times [2019-01-11 14:24:34,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:34,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:34,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:34,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:34,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:34,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:35,092 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 14:24:35,240 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-11 14:24:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:35,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:35,458 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:35,458 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:24:35,458 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [28], [29] [2019-01-11 14:24:35,459 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:35,459 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:35,461 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:35,461 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:24:35,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:35,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:35,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:35,462 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:35,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:35,471 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:35,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:35,502 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 21 treesize of output 24 [2019-01-11 14:24:35,505 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 24 treesize of output 30 [2019-01-11 14:24:35,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,510 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:24:35,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:24:35,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,524 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 30 treesize of output 72 [2019-01-11 14:24:35,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,533 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:24:35,533 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,576 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,624 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,645 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,660 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,710 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-11 14:24:35,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,752 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-11 14:24:35,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:35,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,860 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-11 14:24:35,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:35,931 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-11 14:24:35,932 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,957 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:35,982 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,008 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,035 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,082 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:36,083 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:24:36,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,116 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-11 14:24:36,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,161 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-11 14:24:36,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:24:36,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,195 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-11 14:24:36,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,245 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-11 14:24:36,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 14:24:36,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:36,288 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:36,289 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 119 [2019-01-11 14:24:36,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:36,341 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-11 14:24:36,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-11 14:24:36,366 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-11 14:24:36,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:36,498 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-11 14:24:36,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:36,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:36,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:36,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:36,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:36,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:36,517 INFO L87 Difference]: Start difference. First operand 325 states and 2130 transitions. Second operand 10 states. [2019-01-11 14:24:37,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:37,142 INFO L93 Difference]: Finished difference Result 368 states and 2210 transitions. [2019-01-11 14:24:37,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:37,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:24:37,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:37,147 INFO L225 Difference]: With dead ends: 368 [2019-01-11 14:24:37,148 INFO L226 Difference]: Without dead ends: 366 [2019-01-11 14:24:37,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:37,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-01-11 14:24:37,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 329. [2019-01-11 14:24:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-01-11 14:24:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 2135 transitions. [2019-01-11 14:24:37,213 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 2135 transitions. Word has length 6 [2019-01-11 14:24:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:37,213 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 2135 transitions. [2019-01-11 14:24:37,213 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:37,213 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 2135 transitions. [2019-01-11 14:24:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:37,214 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:37,214 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:24:37,214 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:37,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:37,214 INFO L82 PathProgramCache]: Analyzing trace with hash 904329640, now seen corresponding path program 3 times [2019-01-11 14:24:37,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:37,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:37,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:37,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:37,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:37,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:37,369 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:37,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:37,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:37,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:37,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:37,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:37,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:37,380 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:24:37,380 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:24:37,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:24:37,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:24:37,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:37,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:37,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2019-01-11 14:24:37,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,433 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 26 treesize of output 40 [2019-01-11 14:24:37,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,498 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 28 treesize of output 54 [2019-01-11 14:24:37,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,504 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 30 treesize of output 72 [2019-01-11 14:24:37,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:24:37,514 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:37,553 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:37,574 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:37,590 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:37,606 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:37,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:37,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,651 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-11 14:24:37,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,691 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-11 14:24:37,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,736 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-11 14:24:37,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,791 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-11 14:24:37,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:37,866 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-11 14:24:37,867 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:37,894 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:37,920 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:37,944 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:37,972 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,019 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-11 14:24:38,019 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 14:24:38,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,048 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-11 14:24:38,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,090 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-11 14:24:38,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:101, output treesize:71 [2019-01-11 14:24:38,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,124 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-11 14:24:38,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,173 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-11 14:24:38,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 14:24:38,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,207 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:38,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,209 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-11 14:24:38,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,259 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-11 14:24:38,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 14:24:38,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:38,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, 21 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 135 [2019-01-11 14:24:38,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:38,367 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-11 14:24:38,368 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:45 [2019-01-11 14:24:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:38,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:38,438 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:38,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:38,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:24:38,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:38,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:24:38,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:24:38,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:38,459 INFO L87 Difference]: Start difference. First operand 329 states and 2135 transitions. Second operand 11 states. [2019-01-11 14:24:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:39,271 INFO L93 Difference]: Finished difference Result 407 states and 2353 transitions. [2019-01-11 14:24:39,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:24:39,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 14:24:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:39,277 INFO L225 Difference]: With dead ends: 407 [2019-01-11 14:24:39,277 INFO L226 Difference]: Without dead ends: 401 [2019-01-11 14:24:39,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:24:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2019-01-11 14:24:39,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 341. [2019-01-11 14:24:39,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-11 14:24:39,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 2222 transitions. [2019-01-11 14:24:39,353 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 2222 transitions. Word has length 6 [2019-01-11 14:24:39,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:39,353 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 2222 transitions. [2019-01-11 14:24:39,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:24:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 2222 transitions. [2019-01-11 14:24:39,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:39,355 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:39,355 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:24:39,355 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:39,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:39,355 INFO L82 PathProgramCache]: Analyzing trace with hash 904329206, now seen corresponding path program 1 times [2019-01-11 14:24:39,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:39,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:39,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:24:39,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:39,356 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:39,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:39,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:39,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:39,511 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:24:39,511 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [24], [27] [2019-01-11 14:24:39,512 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:39,512 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:39,514 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:39,514 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:24:39,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:39,515 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:39,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:39,515 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:39,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:39,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:39,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:39,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:39,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 14:24:39,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:24:39,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,628 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 28 treesize of output 54 [2019-01-11 14:24:39,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:24:39,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:24:39,648 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,690 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,714 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,749 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:39,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,798 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-11 14:24:39,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,842 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-11 14:24:39,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,887 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:39,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:39,944 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-11 14:24:40,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,018 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,018 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-11 14:24:40,019 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:40,043 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:40,069 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:40,096 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:40,122 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:40,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:40,169 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:24:40,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,208 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-11 14:24:40,209 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:40,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:40,252 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:24:40,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,290 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-11 14:24:40,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:40,339 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-11 14:24:40,339 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-11 14:24:40,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,378 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:40,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,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, 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-11 14:24:40,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:40,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:40,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 14:24:40,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,473 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:40,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:40,475 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 45 treesize of output 124 [2019-01-11 14:24:40,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:40,529 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-11 14:24:40,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-11 14:24:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:40,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:40,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:40,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:40,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:24:40,621 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:40,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:24:40,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:24:40,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:40,622 INFO L87 Difference]: Start difference. First operand 341 states and 2222 transitions. Second operand 12 states. [2019-01-11 14:24:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:41,748 INFO L93 Difference]: Finished difference Result 645 states and 3901 transitions. [2019-01-11 14:24:41,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-11 14:24:41,748 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:24:41,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:41,756 INFO L225 Difference]: With dead ends: 645 [2019-01-11 14:24:41,756 INFO L226 Difference]: Without dead ends: 643 [2019-01-11 14:24:41,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=295, Unknown=0, NotChecked=0, Total=462 [2019-01-11 14:24:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2019-01-11 14:24:41,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 463. [2019-01-11 14:24:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2019-01-11 14:24:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 3101 transitions. [2019-01-11 14:24:41,866 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 3101 transitions. Word has length 6 [2019-01-11 14:24:41,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:41,866 INFO L480 AbstractCegarLoop]: Abstraction has 463 states and 3101 transitions. [2019-01-11 14:24:41,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:24:41,867 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 3101 transitions. [2019-01-11 14:24:41,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:41,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:41,868 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:24:41,868 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:41,869 INFO L82 PathProgramCache]: Analyzing trace with hash 904333674, now seen corresponding path program 1 times [2019-01-11 14:24:41,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:41,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:41,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:41,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:41,870 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:41,976 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:41,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:41,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:41,977 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:24:41,977 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [28], [30], [31] [2019-01-11 14:24:41,978 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:41,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:41,980 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:41,980 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:24:41,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:41,980 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:41,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:41,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:41,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:41,999 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:42,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:42,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:42,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:24:42,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,087 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 26 treesize of output 36 [2019-01-11 14:24:42,091 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:24:42,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:24:42,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:24:42,114 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:42,139 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:42,161 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:42,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:42,189 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:42,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:42,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:24:42,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:24:42,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:24:42,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:24:42,327 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:42,340 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:42,353 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:42,368 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:42,399 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-11 14:24:42,399 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 14:24:42,443 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 14:24:42,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:42,472 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-11 14:24:42,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:24:42,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:42,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:24:42,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:24:42,660 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-11 14:24:42,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:68 [2019-01-11 14:24:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:42,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:42,719 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-11 14:24:42,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:42,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 14:24:42,739 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:42,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:24:42,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:24:42,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:42,739 INFO L87 Difference]: Start difference. First operand 463 states and 3101 transitions. Second operand 9 states. [2019-01-11 14:24:43,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:43,314 INFO L93 Difference]: Finished difference Result 527 states and 3325 transitions. [2019-01-11 14:24:43,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:24:43,315 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 14:24:43,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:43,321 INFO L225 Difference]: With dead ends: 527 [2019-01-11 14:24:43,321 INFO L226 Difference]: Without dead ends: 524 [2019-01-11 14:24:43,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:24:43,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-01-11 14:24:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 487. [2019-01-11 14:24:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-01-11 14:24:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 3268 transitions. [2019-01-11 14:24:43,434 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 3268 transitions. Word has length 6 [2019-01-11 14:24:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:43,434 INFO L480 AbstractCegarLoop]: Abstraction has 487 states and 3268 transitions. [2019-01-11 14:24:43,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:24:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 3268 transitions. [2019-01-11 14:24:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:43,435 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:43,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:24:43,435 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:43,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:43,436 INFO L82 PathProgramCache]: Analyzing trace with hash 904320156, now seen corresponding path program 1 times [2019-01-11 14:24:43,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:43,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:43,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:43,437 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:43,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:43,529 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:43,529 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:24:43,529 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [28], [29] [2019-01-11 14:24:43,530 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:43,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:43,532 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:43,533 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:24:43,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:43,533 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:43,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:43,533 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:43,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:43,543 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:43,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:43,567 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 21 treesize of output 24 [2019-01-11 14:24:43,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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 30 [2019-01-11 14:24:43,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,574 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 26 treesize of output 40 [2019-01-11 14:24:43,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,578 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:24:43,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,600 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 30 treesize of output 72 [2019-01-11 14:24:43,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:24:43,611 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,642 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,665 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,683 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,698 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:24:43,769 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:24:43,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:24:43,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:24:43,860 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,875 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,890 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,905 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:43,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:43,940 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 14:24:43,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:43,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:24:43,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:44,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:44,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:24:44,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:24:44,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:44,088 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-11 14:24:44,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:40 [2019-01-11 14:24:44,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:44,123 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:44,124 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2019-01-11 14:24:44,124 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:44,160 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-11 14:24:44,161 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 14:24:44,183 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-11 14:24:44,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:44,219 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-11 14:24:44,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:44,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:44,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:44,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:44,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:44,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:44,238 INFO L87 Difference]: Start difference. First operand 487 states and 3268 transitions. Second operand 10 states. [2019-01-11 14:24:44,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:44,893 INFO L93 Difference]: Finished difference Result 534 states and 3436 transitions. [2019-01-11 14:24:44,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:44,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:24:44,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:44,901 INFO L225 Difference]: With dead ends: 534 [2019-01-11 14:24:44,901 INFO L226 Difference]: Without dead ends: 533 [2019-01-11 14:24:44,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=174, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-01-11 14:24:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 505. [2019-01-11 14:24:45,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-01-11 14:24:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 3394 transitions. [2019-01-11 14:24:45,036 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 3394 transitions. Word has length 6 [2019-01-11 14:24:45,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:45,036 INFO L480 AbstractCegarLoop]: Abstraction has 505 states and 3394 transitions. [2019-01-11 14:24:45,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:45,036 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 3394 transitions. [2019-01-11 14:24:45,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:45,037 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:45,038 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:24:45,038 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:45,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:45,038 INFO L82 PathProgramCache]: Analyzing trace with hash 904806422, now seen corresponding path program 1 times [2019-01-11 14:24:45,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:45,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:45,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:45,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:45,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:45,132 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-11 14:24:45,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:45,133 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:45,133 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:24:45,133 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [24], [28], [29] [2019-01-11 14:24:45,134 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:45,134 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:45,136 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:45,137 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:24:45,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:45,137 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:45,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:45,137 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:45,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:45,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:45,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:45,151 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:45,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:45,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:24:45,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,165 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 26 treesize of output 36 [2019-01-11 14:24:45,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,176 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,177 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 28 treesize of output 50 [2019-01-11 14:24:45,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:24:45,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:24:45,200 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,240 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,260 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,278 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,292 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,306 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:24:45,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,355 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 53 treesize of output 63 [2019-01-11 14:24:45,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:24:45,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:24:45,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:24:45,521 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,545 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,568 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,593 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,619 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:45,664 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 14:24:45,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,730 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 41 treesize of output 87 [2019-01-11 14:24:45,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,769 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-11 14:24:45,770 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 14:24:45,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,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, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-11 14:24:45,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,851 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-11 14:24:45,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-11 14:24:45,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,891 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:45,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:45,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 114 [2019-01-11 14:24:45,893 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:45,941 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-11 14:24:45,941 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-11 14:24:45,977 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-11 14:24:45,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:46,019 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:46,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:46,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:46,038 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:46,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:46,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:46,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:46,039 INFO L87 Difference]: Start difference. First operand 505 states and 3394 transitions. Second operand 10 states. [2019-01-11 14:24:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:46,658 INFO L93 Difference]: Finished difference Result 543 states and 3439 transitions. [2019-01-11 14:24:46,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:46,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:24:46,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:46,665 INFO L225 Difference]: With dead ends: 543 [2019-01-11 14:24:46,665 INFO L226 Difference]: Without dead ends: 542 [2019-01-11 14:24:46,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:46,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-01-11 14:24:46,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 500. [2019-01-11 14:24:46,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-11 14:24:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3359 transitions. [2019-01-11 14:24:46,794 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3359 transitions. Word has length 6 [2019-01-11 14:24:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:46,794 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3359 transitions. [2019-01-11 14:24:46,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:46,794 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3359 transitions. [2019-01-11 14:24:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:46,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:46,796 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:24:46,796 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:46,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:46,797 INFO L82 PathProgramCache]: Analyzing trace with hash 904796812, now seen corresponding path program 1 times [2019-01-11 14:24:46,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:46,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:46,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:46,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:46,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:46,885 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-11 14:24:46,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:46,885 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:46,885 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:24:46,886 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [28], [29] [2019-01-11 14:24:46,887 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:46,887 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:46,889 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:46,889 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:24:46,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:46,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:46,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:46,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:46,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:46,899 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:46,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:46,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:46,911 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:46,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:24:46,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,929 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 26 treesize of output 36 [2019-01-11 14:24:46,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,939 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 28 treesize of output 50 [2019-01-11 14:24:46,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,952 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:24:46,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:46,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:24:46,965 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,003 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,023 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,039 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,053 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:24:47,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 14:24:47,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:24:47,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,206 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:24:47,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:24:47,284 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,307 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,333 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,357 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,383 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:47,428 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 14:24:47,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,465 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 41 treesize of output 87 [2019-01-11 14:24:47,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:47,508 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 14:24:47,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,548 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 101 [2019-01-11 14:24:47,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,593 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-11 14:24:47,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-11 14:24:47,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,630 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:47,637 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:47,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-11 14:24:47,639 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:47,703 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-11 14:24:47,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-11 14:24:47,729 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-11 14:24:47,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:47,771 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-11 14:24:47,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:47,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:47,789 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:47,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:47,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:47,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:47,789 INFO L87 Difference]: Start difference. First operand 500 states and 3359 transitions. Second operand 10 states. [2019-01-11 14:24:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:48,457 INFO L93 Difference]: Finished difference Result 537 states and 3427 transitions. [2019-01-11 14:24:48,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:48,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:24:48,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:48,463 INFO L225 Difference]: With dead ends: 537 [2019-01-11 14:24:48,463 INFO L226 Difference]: Without dead ends: 536 [2019-01-11 14:24:48,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:48,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-01-11 14:24:48,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 501. [2019-01-11 14:24:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-01-11 14:24:48,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 3366 transitions. [2019-01-11 14:24:48,583 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 3366 transitions. Word has length 6 [2019-01-11 14:24:48,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:48,583 INFO L480 AbstractCegarLoop]: Abstraction has 501 states and 3366 transitions. [2019-01-11 14:24:48,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:48,584 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 3366 transitions. [2019-01-11 14:24:48,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:48,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:48,585 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:24:48,585 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:48,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:48,585 INFO L82 PathProgramCache]: Analyzing trace with hash 904848706, now seen corresponding path program 1 times [2019-01-11 14:24:48,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:48,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:48,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:48,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:48,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:48,969 WARN L181 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 20 [2019-01-11 14:24:49,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:49,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:49,011 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:49,011 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:24:49,011 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [29] [2019-01-11 14:24:49,013 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:49,014 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:49,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:49,016 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:24:49,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:49,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:49,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:49,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:49,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:49,046 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:49,062 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:49,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:49,098 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 24 treesize of output 30 [2019-01-11 14:24:49,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,103 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 26 treesize of output 40 [2019-01-11 14:24:49,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,109 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 28 treesize of output 54 [2019-01-11 14:24:49,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,118 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 30 treesize of output 72 [2019-01-11 14:24:49,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,127 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:24:49,127 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,165 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,189 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,267 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-11 14:24:49,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 14:24:49,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,354 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:24:49,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:24:49,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,481 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-11 14:24:49,482 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,587 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,610 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,637 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,664 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:24:49,710 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:24:49,746 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,746 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-11 14:24:49,747 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,788 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-11 14:24:49,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:24:49,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,821 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:49,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 43 treesize of output 106 [2019-01-11 14:24:49,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,881 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-11 14:24:49,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:59 [2019-01-11 14:24:49,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:49,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, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 115 [2019-01-11 14:24:49,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:49,990 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-11 14:24:49,991 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:73, output treesize:51 [2019-01-11 14:24:50,011 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-11 14:24:50,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:50,051 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-11 14:24:50,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:50,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:24:50,069 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:50,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:50,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:50,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:50,070 INFO L87 Difference]: Start difference. First operand 501 states and 3366 transitions. Second operand 10 states. [2019-01-11 14:24:50,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:50,815 INFO L93 Difference]: Finished difference Result 588 states and 3737 transitions. [2019-01-11 14:24:50,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:24:50,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:24:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:50,821 INFO L225 Difference]: With dead ends: 588 [2019-01-11 14:24:50,821 INFO L226 Difference]: Without dead ends: 587 [2019-01-11 14:24:50,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:24:50,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-01-11 14:24:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 534. [2019-01-11 14:24:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-01-11 14:24:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 3605 transitions. [2019-01-11 14:24:50,945 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 3605 transitions. Word has length 6 [2019-01-11 14:24:50,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:50,946 INFO L480 AbstractCegarLoop]: Abstraction has 534 states and 3605 transitions. [2019-01-11 14:24:50,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 3605 transitions. [2019-01-11 14:24:50,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:50,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:50,947 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:24:50,947 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:50,947 INFO L82 PathProgramCache]: Analyzing trace with hash 904869912, now seen corresponding path program 1 times [2019-01-11 14:24:50,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:50,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:50,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:50,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:50,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:51,082 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-11 14:24:51,126 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-11 14:24:51,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:51,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:51,127 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:24:51,127 INFO L207 CegarAbsIntRunner]: [0], [18], [24], [28], [30], [31] [2019-01-11 14:24:51,128 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:51,128 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:51,131 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:51,131 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:24:51,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:51,132 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:51,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:51,132 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:51,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:51,148 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:51,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:51,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:51,161 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:24:51,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,167 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 26 treesize of output 36 [2019-01-11 14:24:51,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,175 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 28 treesize of output 50 [2019-01-11 14:24:51,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:24:51,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,196 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:24:51,197 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,235 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,255 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,270 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,284 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,297 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:24:51,456 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-11 14:24:51,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,463 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 53 treesize of output 63 [2019-01-11 14:24:51,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:24:51,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:24:51,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,619 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,626 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:24:51,627 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,652 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,676 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,700 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,727 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,770 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-11 14:24:51,771 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 14:24:51,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,795 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 41 treesize of output 87 [2019-01-11 14:24:51,796 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,836 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-11 14:24:51,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 14:24:51,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:51,866 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:51,867 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 43 treesize of output 102 [2019-01-11 14:24:51,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:51,912 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-11 14:24:51,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:55 [2019-01-11 14:24:51,933 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-11 14:24:51,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:51,954 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-11 14:24:51,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:51,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:24:51,973 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:51,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:24:51,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:24:51,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:51,973 INFO L87 Difference]: Start difference. First operand 534 states and 3605 transitions. Second operand 8 states. [2019-01-11 14:24:52,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:52,475 INFO L93 Difference]: Finished difference Result 558 states and 3635 transitions. [2019-01-11 14:24:52,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:24:52,476 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:24:52,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:52,479 INFO L225 Difference]: With dead ends: 558 [2019-01-11 14:24:52,479 INFO L226 Difference]: Without dead ends: 557 [2019-01-11 14:24:52,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:24:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2019-01-11 14:24:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 533. [2019-01-11 14:24:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2019-01-11 14:24:52,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 3598 transitions. [2019-01-11 14:24:52,601 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 3598 transitions. Word has length 6 [2019-01-11 14:24:52,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:52,601 INFO L480 AbstractCegarLoop]: Abstraction has 533 states and 3598 transitions. [2019-01-11 14:24:52,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:24:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 3598 transitions. [2019-01-11 14:24:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:52,603 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:52,603 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:24:52,603 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash 904431632, now seen corresponding path program 1 times [2019-01-11 14:24:52,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:52,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:52,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:52,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:52,747 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-11 14:24:52,782 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-11 14:24:52,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:52,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:52,783 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:24:52,783 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [29] [2019-01-11 14:24:52,784 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:52,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:52,786 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:52,787 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:24:52,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:52,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:52,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:52,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:52,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:52,800 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:52,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:52,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,831 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:24:52,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:24:52,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:24:52,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:52,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:24:52,955 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:52,973 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:52,989 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:53,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:53,032 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 21 treesize of output 24 [2019-01-11 14:24:53,036 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 24 treesize of output 30 [2019-01-11 14:24:53,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:24:53,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:24:53,046 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 30 treesize of output 72 [2019-01-11 14:24:53,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:24:53,055 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:53,083 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:53,103 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:53,119 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:53,132 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:53,144 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:53,177 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-11 14:24:53,177 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:24:53,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:24:53,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:53,241 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-11 14:24:53,241 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:24:53,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,267 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:53,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 14:24:53,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:53,297 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-11 14:24:53,298 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:62, output treesize:42 [2019-01-11 14:24:53,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:53,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 90 [2019-01-11 14:24:53,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:53,361 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-11 14:24:53,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2019-01-11 14:24:53,380 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-11 14:24:53,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:53,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:53,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:24:53,422 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:53,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:24:53,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:24:53,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=91, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:24:53,422 INFO L87 Difference]: Start difference. First operand 533 states and 3598 transitions. Second operand 10 states. [2019-01-11 14:24:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:54,127 INFO L93 Difference]: Finished difference Result 795 states and 5176 transitions. [2019-01-11 14:24:54,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:24:54,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:24:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:54,131 INFO L225 Difference]: With dead ends: 795 [2019-01-11 14:24:54,132 INFO L226 Difference]: Without dead ends: 794 [2019-01-11 14:24:54,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=108, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:24:54,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-01-11 14:24:54,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 484. [2019-01-11 14:24:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-01-11 14:24:54,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 3230 transitions. [2019-01-11 14:24:54,281 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 3230 transitions. Word has length 6 [2019-01-11 14:24:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:54,282 INFO L480 AbstractCegarLoop]: Abstraction has 484 states and 3230 transitions. [2019-01-11 14:24:54,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:24:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 3230 transitions. [2019-01-11 14:24:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:54,283 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:54,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:24:54,283 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:54,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:54,283 INFO L82 PathProgramCache]: Analyzing trace with hash 904452838, now seen corresponding path program 1 times [2019-01-11 14:24:54,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:54,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:54,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:54,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:54,284 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:54,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:54,415 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-11 14:24:54,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:54,415 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:54,415 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:24:54,415 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [28], [30], [31] [2019-01-11 14:24:54,416 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:24:54,416 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:24:54,418 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:24:54,418 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:24:54,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:54,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:24:54,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:54,419 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:54,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:54,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:54,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:54,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:24:54,443 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:24:54,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,451 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:24:54,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,458 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 28 treesize of output 50 [2019-01-11 14:24:54,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:24:54,478 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:24:54,479 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,505 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,527 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,556 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,593 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:24:54,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:24:54,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:24:54,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,691 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:24:54,692 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,707 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,720 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,736 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,767 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-11 14:24:54,767 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 14:24:54,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 14:24:54,812 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:54,837 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-11 14:24:54,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:24:54,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:54,868 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:54,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 81 [2019-01-11 14:24:54,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:24:54,971 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-11 14:24:54,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:58, output treesize:76 [2019-01-11 14:24:55,020 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-11 14:24:55,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:55,041 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-11 14:24:55,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:55,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 9 [2019-01-11 14:24:55,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:55,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:24:55,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:24:55,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:24:55,060 INFO L87 Difference]: Start difference. First operand 484 states and 3230 transitions. Second operand 9 states. [2019-01-11 14:24:55,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:24:55,896 INFO L93 Difference]: Finished difference Result 539 states and 3425 transitions. [2019-01-11 14:24:55,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:24:55,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 14:24:55,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:24:55,900 INFO L225 Difference]: With dead ends: 539 [2019-01-11 14:24:55,901 INFO L226 Difference]: Without dead ends: 538 [2019-01-11 14:24:55,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:24:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-01-11 14:24:56,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 500. [2019-01-11 14:24:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-01-11 14:24:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 3342 transitions. [2019-01-11 14:24:56,114 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 3342 transitions. Word has length 6 [2019-01-11 14:24:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:24:56,114 INFO L480 AbstractCegarLoop]: Abstraction has 500 states and 3342 transitions. [2019-01-11 14:24:56,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:24:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 3342 transitions. [2019-01-11 14:24:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:24:56,115 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:24:56,115 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:24:56,115 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:24:56,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:24:56,115 INFO L82 PathProgramCache]: Analyzing trace with hash 893599114, now seen corresponding path program 4 times [2019-01-11 14:24:56,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:24:56,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:56,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:56,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:24:56,116 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:24:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:56,208 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:24:56,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:56,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:24:56,208 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:24:56,208 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:24:56,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:24:56,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:24:56,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:24:56,218 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:24:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:24:56,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:24:56,248 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 21 treesize of output 24 [2019-01-11 14:24:56,265 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 24 treesize of output 30 [2019-01-11 14:24:56,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,270 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 26 treesize of output 40 [2019-01-11 14:24:56,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,276 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 28 treesize of output 54 [2019-01-11 14:24:56,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,282 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 30 treesize of output 72 [2019-01-11 14:24:56,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:24:56,292 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,320 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,343 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,361 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,374 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,414 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:24:56,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:24:56,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:24:56,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:24:56,572 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,589 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,605 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,621 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:24:56,654 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-11 14:24:56,654 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:24:56,866 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-11 14:24:56,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:56,910 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 14:24:56,911 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:24:57,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-01-11 14:24:57,022 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:109 [2019-01-11 14:24:57,220 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-01-11 14:24:57,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 81 [2019-01-11 14:24:57,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:57,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,338 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 2 case distinctions, treesize of input 65 treesize of output 91 [2019-01-11 14:24:57,339 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-11 14:24:57,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-11 14:24:57,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:129, output treesize:126 [2019-01-11 14:24:57,737 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-01-11 14:24:57,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,744 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,745 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 101 [2019-01-11 14:24:57,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:57,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,863 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 55 treesize of output 111 [2019-01-11 14:24:57,863 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:57,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:57,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-11 14:24:57,970 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:58,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 11 dim-0 vars, and 3 xjuncts. [2019-01-11 14:24:58,056 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:159, output treesize:123 [2019-01-11 14:24:58,267 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-11 14:24:58,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,273 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,287 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,316 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 6 case distinctions, treesize of input 55 treesize of output 125 [2019-01-11 14:24:58,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 14:24:58,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,644 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-11 14:24:58,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:58,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,809 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:24:58,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:24:58,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-11 14:24:58,812 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:24:58,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 3 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-11 14:24:58,949 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:156, output treesize:238 [2019-01-11 14:24:59,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:59,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:24:59,176 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:24:59,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:24:59,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:24:59,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:24:59,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:24:59,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:24:59,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:24:59,197 INFO L87 Difference]: Start difference. First operand 500 states and 3342 transitions. Second operand 11 states. [2019-01-11 14:24:59,463 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-11 14:25:00,092 WARN L181 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 36 [2019-01-11 14:25:00,584 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 51 [2019-01-11 14:25:01,276 WARN L181 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 57 [2019-01-11 14:25:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:02,123 INFO L93 Difference]: Finished difference Result 678 states and 4253 transitions. [2019-01-11 14:25:02,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:25:02,123 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 14:25:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:02,128 INFO L225 Difference]: With dead ends: 678 [2019-01-11 14:25:02,129 INFO L226 Difference]: Without dead ends: 673 [2019-01-11 14:25:02,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:25:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-01-11 14:25:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 555. [2019-01-11 14:25:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-01-11 14:25:02,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 3727 transitions. [2019-01-11 14:25:02,393 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 3727 transitions. Word has length 6 [2019-01-11 14:25:02,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:02,393 INFO L480 AbstractCegarLoop]: Abstraction has 555 states and 3727 transitions. [2019-01-11 14:25:02,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:25:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 3727 transitions. [2019-01-11 14:25:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:02,394 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:02,394 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-01-11 14:25:02,394 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:02,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:02,395 INFO L82 PathProgramCache]: Analyzing trace with hash 893598680, now seen corresponding path program 2 times [2019-01-11 14:25:02,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:02,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:02,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:02,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:02,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:02,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:02,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:02,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:02,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:25:02,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:25:02,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:02,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:02,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:25:02,484 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:25:02,491 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:25:02,491 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:25:02,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:02,518 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 21 treesize of output 24 [2019-01-11 14:25:02,521 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 24 treesize of output 30 [2019-01-11 14:25:02,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:25:02,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,536 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 28 treesize of output 54 [2019-01-11 14:25:02,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:25:02,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:25:02,568 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:02,610 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:02,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:02,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:02,665 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:02,679 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:02,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,711 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-11 14:25:02,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,750 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-11 14:25:02,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:02,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,853 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:25:02,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:02,927 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-11 14:25:02,927 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:02,954 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:02,984 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:03,027 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:03,053 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:03,100 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-11 14:25:03,101 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 14:25:03,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,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 41 treesize of output 97 [2019-01-11 14:25:03,132 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:03,177 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-11 14:25:03,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:25:03,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,300 INFO L303 Elim1Store]: Index analysis took 101 ms [2019-01-11 14:25:03,300 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-11 14:25:03,301 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:03,349 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-11 14:25:03,349 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 14:25:03,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,385 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 43 treesize of output 123 [2019-01-11 14:25:03,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:03,442 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-11 14:25:03,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:55 [2019-01-11 14:25:03,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,482 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:03,487 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 43 treesize of output 135 [2019-01-11 14:25:03,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:03,545 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-11 14:25:03,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:45 [2019-01-11 14:25:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:03,568 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:03,614 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:03,632 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:03,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:25:03,633 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:03,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:25:03,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:25:03,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:03,633 INFO L87 Difference]: Start difference. First operand 555 states and 3727 transitions. Second operand 11 states. [2019-01-11 14:25:04,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:04,488 INFO L93 Difference]: Finished difference Result 704 states and 4501 transitions. [2019-01-11 14:25:04,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:25:04,489 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-01-11 14:25:04,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:04,494 INFO L225 Difference]: With dead ends: 704 [2019-01-11 14:25:04,495 INFO L226 Difference]: Without dead ends: 703 [2019-01-11 14:25:04,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:25:04,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-01-11 14:25:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 655. [2019-01-11 14:25:04,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-01-11 14:25:04,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 4427 transitions. [2019-01-11 14:25:04,780 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 4427 transitions. Word has length 6 [2019-01-11 14:25:04,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:04,781 INFO L480 AbstractCegarLoop]: Abstraction has 655 states and 4427 transitions. [2019-01-11 14:25:04,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:25:04,781 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 4427 transitions. [2019-01-11 14:25:04,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:04,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:04,782 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:04,782 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:04,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:04,782 INFO L82 PathProgramCache]: Analyzing trace with hash 893604446, now seen corresponding path program 2 times [2019-01-11 14:25:04,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:04,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:04,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:25:04,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:04,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:04,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:04,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:04,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:04,955 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:25:04,955 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:25:04,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:04,955 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:04,966 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:25:04,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:25:04,973 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:25:04,973 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:25:04,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:04,995 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 21 treesize of output 24 [2019-01-11 14:25:05,013 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 24 treesize of output 30 [2019-01-11 14:25:05,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:25:05,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,027 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 28 treesize of output 54 [2019-01-11 14:25:05,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:25:05,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,044 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:25:05,044 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,104 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,125 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,158 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,172 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,207 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,208 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-11 14:25:05,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,249 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-11 14:25:05,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,297 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-11 14:25:05,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,354 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-11 14:25:05,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,426 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-11 14:25:05,426 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,453 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,479 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,504 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,530 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:05,582 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:25:05,623 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,624 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-11 14:25:05,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:05,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 14:25:05,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,718 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,723 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-11 14:25:05,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,773 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-11 14:25:05,773 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 14:25:05,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,813 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:05,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,815 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-11 14:25:05,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:05,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 14:25:05,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,903 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:05,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:05,905 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 45 treesize of output 124 [2019-01-11 14:25:05,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:05,958 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-11 14:25:05,959 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-11 14:25:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:05,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:06,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:06,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:25:06,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:06,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:06,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:06,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:06,054 INFO L87 Difference]: Start difference. First operand 655 states and 4427 transitions. Second operand 12 states. [2019-01-11 14:25:07,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:07,479 INFO L93 Difference]: Finished difference Result 1218 states and 7896 transitions. [2019-01-11 14:25:07,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:25:07,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:25:07,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:07,488 INFO L225 Difference]: With dead ends: 1218 [2019-01-11 14:25:07,488 INFO L226 Difference]: Without dead ends: 1217 [2019-01-11 14:25:07,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:25:07,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2019-01-11 14:25:07,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 738. [2019-01-11 14:25:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2019-01-11 14:25:07,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 5008 transitions. [2019-01-11 14:25:07,846 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 5008 transitions. Word has length 6 [2019-01-11 14:25:07,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:07,847 INFO L480 AbstractCegarLoop]: Abstraction has 738 states and 5008 transitions. [2019-01-11 14:25:07,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:07,847 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 5008 transitions. [2019-01-11 14:25:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:07,848 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:07,848 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:07,848 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash 893724170, now seen corresponding path program 1 times [2019-01-11 14:25:07,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:07,849 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:25:07,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:07,849 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:07,994 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 14:25:08,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:08,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:08,016 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:08,017 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:08,017 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [29] [2019-01-11 14:25:08,018 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:08,018 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:08,020 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:08,020 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:25:08,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:08,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:08,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:08,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:08,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:08,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:08,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:08,094 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 21 treesize of output 24 [2019-01-11 14:25:08,097 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 24 treesize of output 30 [2019-01-11 14:25:08,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,101 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 26 treesize of output 40 [2019-01-11 14:25:08,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,106 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,108 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:25:08,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,115 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,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 30 treesize of output 72 [2019-01-11 14:25:08,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,125 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:25:08,126 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,165 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,189 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,208 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,235 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,271 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-11 14:25:08,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,311 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-11 14:25:08,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 14:25:08,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,415 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-11 14:25:08,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,489 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-11 14:25:08,490 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,516 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,542 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,568 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,595 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:08,642 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:25:08,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,678 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-11 14:25:08,679 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,723 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-11 14:25:08,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:25:08,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,759 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:08,760 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 105 [2019-01-11 14:25:08,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,807 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-11 14:25:08,808 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:81, output treesize:59 [2019-01-11 14:25:08,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:08,848 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-11 14:25:08,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:08,898 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-11 14:25:08,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:47 [2019-01-11 14:25:08,921 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-11 14:25:08,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:08,964 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-11 14:25:08,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:08,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:25:08,984 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:08,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:25:08,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:25:08,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:25:08,984 INFO L87 Difference]: Start difference. First operand 738 states and 5008 transitions. Second operand 10 states. [2019-01-11 14:25:09,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:09,833 INFO L93 Difference]: Finished difference Result 814 states and 5311 transitions. [2019-01-11 14:25:09,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:25:09,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:25:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:09,844 INFO L225 Difference]: With dead ends: 814 [2019-01-11 14:25:09,844 INFO L226 Difference]: Without dead ends: 811 [2019-01-11 14:25:09,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=176, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:25:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-11 14:25:10,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 775. [2019-01-11 14:25:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2019-01-11 14:25:10,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 5267 transitions. [2019-01-11 14:25:10,188 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 5267 transitions. Word has length 6 [2019-01-11 14:25:10,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:10,188 INFO L480 AbstractCegarLoop]: Abstraction has 775 states and 5267 transitions. [2019-01-11 14:25:10,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:25:10,189 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 5267 transitions. [2019-01-11 14:25:10,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:10,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:10,190 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:10,190 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:10,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:10,191 INFO L82 PathProgramCache]: Analyzing trace with hash 893714560, now seen corresponding path program 1 times [2019-01-11 14:25:10,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:10,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:10,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:10,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:10,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:10,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:10,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:10,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:10,297 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:10,297 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [28], [29] [2019-01-11 14:25:10,298 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:10,298 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:10,300 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:10,300 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:25:10,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:10,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:10,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:10,301 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:10,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:10,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:10,319 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:10,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,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 48 treesize of output 54 [2019-01-11 14:25:10,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:25:10,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:25:10,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:25:10,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,484 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,501 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,543 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 21 treesize of output 24 [2019-01-11 14:25:10,547 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 24 treesize of output 30 [2019-01-11 14:25:10,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:25:10,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:25:10,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:25:10,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:25:10,569 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,597 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,617 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,640 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,659 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,673 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:10,706 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 14:25:10,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:25:10,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:10,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:25:10,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,826 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:10,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:25:10,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,861 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-11 14:25:10,861 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-11 14:25:10,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:10,894 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:10,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:25:10,896 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:10,930 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-11 14:25:10,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:42 [2019-01-11 14:25:10,953 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-11 14:25:10,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:11,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:11,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 11 [2019-01-11 14:25:11,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:11,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-11 14:25:11,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-11 14:25:11,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:25:11,011 INFO L87 Difference]: Start difference. First operand 775 states and 5267 transitions. Second operand 9 states. [2019-01-11 14:25:11,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:11,909 INFO L93 Difference]: Finished difference Result 812 states and 5339 transitions. [2019-01-11 14:25:11,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:25:11,909 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 6 [2019-01-11 14:25:11,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:11,913 INFO L225 Difference]: With dead ends: 812 [2019-01-11 14:25:11,913 INFO L226 Difference]: Without dead ends: 811 [2019-01-11 14:25:11,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-01-11 14:25:12,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 780. [2019-01-11 14:25:12,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-01-11 14:25:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 5302 transitions. [2019-01-11 14:25:12,206 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 5302 transitions. Word has length 6 [2019-01-11 14:25:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:12,206 INFO L480 AbstractCegarLoop]: Abstraction has 780 states and 5302 transitions. [2019-01-11 14:25:12,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-11 14:25:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 5302 transitions. [2019-01-11 14:25:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:12,208 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:12,208 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:12,208 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:12,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:12,208 INFO L82 PathProgramCache]: Analyzing trace with hash 893787660, now seen corresponding path program 1 times [2019-01-11 14:25:12,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:12,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:12,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:12,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:12,209 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:12,287 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-11 14:25:12,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:12,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:12,288 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:12,288 INFO L207 CegarAbsIntRunner]: [0], [6], [24], [28], [30], [31] [2019-01-11 14:25:12,289 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:12,289 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:12,291 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:12,292 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:25:12,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:12,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:12,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:12,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:12,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:12,303 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:12,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:12,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:12,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:25:12,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:25:12,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,340 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 26 treesize of output 36 [2019-01-11 14:25:12,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:25:12,352 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:25:12,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:25:12,370 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:12,408 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:12,429 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:12,447 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:12,459 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:12,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:12,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:25:12,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,521 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 53 treesize of output 63 [2019-01-11 14:25:12,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:25:12,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,618 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:25:12,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:12,686 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:25:12,687 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:12,711 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:12,735 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:12,760 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:12,787 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:12,831 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-11 14:25:12,831 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 14:25:12,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,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, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 14:25:13,075 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:25:13,460 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-11 14:25:13,461 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-11 14:25:13,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:13,513 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:25:13,513 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:13,548 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-11 14:25:13,548 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:38 [2019-01-11 14:25:13,666 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-11 14:25:13,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:13,685 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-11 14:25:13,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:13,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:25:13,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:13,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:25:13,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:25:13,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:25:13,705 INFO L87 Difference]: Start difference. First operand 780 states and 5302 transitions. Second operand 8 states. [2019-01-11 14:25:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:14,417 INFO L93 Difference]: Finished difference Result 843 states and 5575 transitions. [2019-01-11 14:25:14,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:25:14,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:25:14,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:14,420 INFO L225 Difference]: With dead ends: 843 [2019-01-11 14:25:14,420 INFO L226 Difference]: Without dead ends: 842 [2019-01-11 14:25:14,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2019-01-11 14:25:14,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-01-11 14:25:14,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 813. [2019-01-11 14:25:14,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-01-11 14:25:14,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 5533 transitions. [2019-01-11 14:25:14,736 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 5533 transitions. Word has length 6 [2019-01-11 14:25:14,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:14,736 INFO L480 AbstractCegarLoop]: Abstraction has 813 states and 5533 transitions. [2019-01-11 14:25:14,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:25:14,736 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 5533 transitions. [2019-01-11 14:25:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:14,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:14,738 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:14,738 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:14,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:14,738 INFO L82 PathProgramCache]: Analyzing trace with hash 893774142, now seen corresponding path program 1 times [2019-01-11 14:25:14,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:14,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:14,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:14,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:14,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:25:14,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:14,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:14,809 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:14,810 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [29] [2019-01-11 14:25:14,810 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:14,810 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:14,811 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:14,812 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:25:14,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:14,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:14,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:14,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:14,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:14,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:14,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:14,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:25:14,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:25:14,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:25:14,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:14,981 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:25:14,982 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:15,004 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:15,025 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:15,047 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:15,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:25:15,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 14:25:15,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:25:15,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:25:15,090 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 30 treesize of output 72 [2019-01-11 14:25:15,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:25:15,099 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:15,125 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:15,146 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:15,162 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:15,174 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:15,186 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:15,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:15,220 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 14:25:15,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 14:25:15,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:25:15,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:25:15,442 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-11 14:25:15,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,595 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 8 case distinctions, treesize of input 65 treesize of output 103 [2019-01-11 14:25:15,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 16 xjuncts. [2019-01-11 14:25:15,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:15,912 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:15,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 88 [2019-01-11 14:25:15,913 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:16,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 19 dim-0 vars, and 6 xjuncts. [2019-01-11 14:25:16,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:126, output treesize:278 [2019-01-11 14:25:16,272 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 103 [2019-01-11 14:25:16,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 88 [2019-01-11 14:25:16,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:16,403 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,413 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:16,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,415 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 100 [2019-01-11 14:25:16,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:16,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,552 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:16,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 94 [2019-01-11 14:25:16,555 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:16,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:16,679 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:16,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-11 14:25:16,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:16,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-11 14:25:16,790 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:227, output treesize:173 [2019-01-11 14:25:16,947 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-01-11 14:25:16,951 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-11 14:25:16,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:17,013 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-11 14:25:17,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:17,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:25:17,031 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:17,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:25:17,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:25:17,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:25:17,032 INFO L87 Difference]: Start difference. First operand 813 states and 5533 transitions. Second operand 10 states. [2019-01-11 14:25:17,226 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 46 [2019-01-11 14:25:17,461 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-11 14:25:17,790 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2019-01-11 14:25:18,350 WARN L181 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-01-11 14:25:21,005 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 83 [2019-01-11 14:25:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:21,322 INFO L93 Difference]: Finished difference Result 896 states and 5824 transitions. [2019-01-11 14:25:21,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:25:21,322 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:25:21,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:21,326 INFO L225 Difference]: With dead ends: 896 [2019-01-11 14:25:21,326 INFO L226 Difference]: Without dead ends: 895 [2019-01-11 14:25:21,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:25:21,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-01-11 14:25:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 848. [2019-01-11 14:25:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 848 states. [2019-01-11 14:25:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 5778 transitions. [2019-01-11 14:25:21,685 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 5778 transitions. Word has length 6 [2019-01-11 14:25:21,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:21,685 INFO L480 AbstractCegarLoop]: Abstraction has 848 states and 5778 transitions. [2019-01-11 14:25:21,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:25:21,685 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 5778 transitions. [2019-01-11 14:25:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:21,686 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:21,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:21,687 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:21,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:21,687 INFO L82 PathProgramCache]: Analyzing trace with hash 893364756, now seen corresponding path program 1 times [2019-01-11 14:25:21,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:21,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:21,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:21,688 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:21,773 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-11 14:25:21,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:21,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:21,774 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:21,774 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [22], [28], [29] [2019-01-11 14:25:21,775 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:21,775 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:21,777 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:21,777 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:25:21,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:21,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:21,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:21,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:21,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:21,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:21,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:21,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:25:21,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:25:21,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:25:21,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:21,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:25:21,950 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:21,967 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:21,985 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:22,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:22,027 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 21 treesize of output 24 [2019-01-11 14:25:22,030 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 24 treesize of output 30 [2019-01-11 14:25:22,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:25:22,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:25:22,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:25:22,049 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:25:22,049 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:22,074 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:22,095 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:22,112 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:22,126 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:22,138 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:22,172 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-11 14:25:22,173 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:72, output treesize:71 [2019-01-11 14:25:22,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:25:22,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:22,249 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-11 14:25:22,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:50 [2019-01-11 14:25:22,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:25:22,280 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:22,316 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-11 14:25:22,317 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:38 [2019-01-11 14:25:22,552 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-11 14:25:22,579 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:22,608 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:22,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:25:22,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:22,787 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-11 14:25:22,787 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:36 [2019-01-11 14:25:22,806 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-11 14:25:22,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:22,842 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-11 14:25:22,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:22,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:25:22,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:22,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:25:22,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:25:22,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:25:22,862 INFO L87 Difference]: Start difference. First operand 848 states and 5778 transitions. Second operand 10 states. [2019-01-11 14:25:23,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:23,893 INFO L93 Difference]: Finished difference Result 975 states and 6393 transitions. [2019-01-11 14:25:23,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:25:23,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:25:23,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:23,898 INFO L225 Difference]: With dead ends: 975 [2019-01-11 14:25:23,898 INFO L226 Difference]: Without dead ends: 973 [2019-01-11 14:25:23,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2019-01-11 14:25:24,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 930. [2019-01-11 14:25:24,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 930 states. [2019-01-11 14:25:24,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 6346 transitions. [2019-01-11 14:25:24,286 INFO L78 Accepts]: Start accepts. Automaton has 930 states and 6346 transitions. Word has length 6 [2019-01-11 14:25:24,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:24,286 INFO L480 AbstractCegarLoop]: Abstraction has 930 states and 6346 transitions. [2019-01-11 14:25:24,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:25:24,286 INFO L276 IsEmpty]: Start isEmpty. Operand 930 states and 6346 transitions. [2019-01-11 14:25:24,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:24,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:24,288 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:24,288 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:24,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:24,289 INFO L82 PathProgramCache]: Analyzing trace with hash 893370586, now seen corresponding path program 1 times [2019-01-11 14:25:24,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:24,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:24,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:24,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:24,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:24,370 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-11 14:25:24,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:24,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:24,371 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:24,372 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [28], [30], [31] [2019-01-11 14:25:24,372 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:24,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:24,374 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:24,374 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:25:24,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:24,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:24,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:24,375 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:24,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:24,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:24,407 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:24,410 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:25:24,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:25:24,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:25:24,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,430 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 28 treesize of output 50 [2019-01-11 14:25:24,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,439 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:25:24,482 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:25:24,483 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:24,510 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:24,532 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:24,549 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:24,562 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:24,574 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:24,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:25:24,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,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 36 treesize of output 49 [2019-01-11 14:25:24,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:25:24,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,691 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:25:24,698 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:24,714 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:24,728 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:24,745 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:24,774 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-11 14:25:24,775 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 14:25:24,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:25:24,821 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:25:24,915 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:25:24,915 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-11 14:25:24,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:24,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 86 [2019-01-11 14:25:24,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:25,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:25,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:25,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:25,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:25,030 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:25,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 59 [2019-01-11 14:25:25,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:25,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:25:25,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:108, output treesize:84 [2019-01-11 14:25:25,159 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-11 14:25:25,160 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:25,180 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-11 14:25:25,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:25,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:25:25,199 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:25,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:25:25,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:25:25,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:25:25,200 INFO L87 Difference]: Start difference. First operand 930 states and 6346 transitions. Second operand 8 states. [2019-01-11 14:25:25,561 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-01-11 14:25:27,731 WARN L181 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2019-01-11 14:25:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:28,554 INFO L93 Difference]: Finished difference Result 985 states and 6551 transitions. [2019-01-11 14:25:28,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:25:28,555 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:25:28,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:28,558 INFO L225 Difference]: With dead ends: 985 [2019-01-11 14:25:28,558 INFO L226 Difference]: Without dead ends: 984 [2019-01-11 14:25:28,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:25:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-01-11 14:25:28,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 951. [2019-01-11 14:25:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-01-11 14:25:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 6492 transitions. [2019-01-11 14:25:28,961 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 6492 transitions. Word has length 6 [2019-01-11 14:25:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:28,962 INFO L480 AbstractCegarLoop]: Abstraction has 951 states and 6492 transitions. [2019-01-11 14:25:28,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:25:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 6492 transitions. [2019-01-11 14:25:28,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:28,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:28,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:28,964 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:28,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:28,964 INFO L82 PathProgramCache]: Analyzing trace with hash 908380782, now seen corresponding path program 1 times [2019-01-11 14:25:28,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:28,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:28,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:28,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:28,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:29,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:29,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:29,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:29,067 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:29,067 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [24], [27] [2019-01-11 14:25:29,067 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:29,068 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:29,069 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:29,069 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:25:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:29,069 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:29,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:29,069 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:29,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:29,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:29,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:29,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,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-11 14:25:29,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 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-11 14:25:29,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,199 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:29,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,257 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:25:29,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,327 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-11 14:25:29,328 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,352 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,403 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,428 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:25:29,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, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 14:25:29,470 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 26 treesize of output 40 [2019-01-11 14:25:29,472 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 28 treesize of output 54 [2019-01-11 14:25:29,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:25:29,476 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:25:29,476 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,508 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,527 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,543 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,555 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,567 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:29,611 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 14:25:29,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,654 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-11 14:25:29,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:29,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 14:25:29,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,742 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-11 14:25:29,742 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,787 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-11 14:25:29,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 14:25:29,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,825 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,831 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:29,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,832 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-11 14:25:29,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,882 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-11 14:25:29,883 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 14:25:29,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,921 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:29,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:29,922 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 45 treesize of output 124 [2019-01-11 14:25:29,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:29,974 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-11 14:25:29,975 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-11 14:25:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:30,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:30,646 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:30,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:30,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:25:30,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:30,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:30,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:30,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:25:30,665 INFO L87 Difference]: Start difference. First operand 951 states and 6492 transitions. Second operand 12 states. [2019-01-11 14:25:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:34,924 INFO L93 Difference]: Finished difference Result 1024 states and 6701 transitions. [2019-01-11 14:25:34,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:25:34,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:25:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:34,928 INFO L225 Difference]: With dead ends: 1024 [2019-01-11 14:25:34,929 INFO L226 Difference]: Without dead ends: 1023 [2019-01-11 14:25:34,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:25:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2019-01-11 14:25:35,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 948. [2019-01-11 14:25:35,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 948 states. [2019-01-11 14:25:35,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 6467 transitions. [2019-01-11 14:25:35,316 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 6467 transitions. Word has length 6 [2019-01-11 14:25:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:35,316 INFO L480 AbstractCegarLoop]: Abstraction has 948 states and 6467 transitions. [2019-01-11 14:25:35,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 6467 transitions. [2019-01-11 14:25:35,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:35,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:35,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:35,318 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:35,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:35,318 INFO L82 PathProgramCache]: Analyzing trace with hash 908380906, now seen corresponding path program 1 times [2019-01-11 14:25:35,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:35,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:35,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:35,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:35,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:35,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:35,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:35,480 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:35,481 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [27] [2019-01-11 14:25:35,482 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:35,482 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:35,483 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:35,483 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:25:35,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:35,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:35,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:35,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:35,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:35,497 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:35,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:35,529 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 21 treesize of output 24 [2019-01-11 14:25:35,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 14:25:35,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:25:35,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,546 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 28 treesize of output 54 [2019-01-11 14:25:35,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:25:35,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,564 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:25:35,564 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:35,606 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:35,629 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:35,648 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:35,664 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:35,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:35,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,710 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-11 14:25:35,749 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,751 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-11 14:25:35,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,796 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-11 14:25:35,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,849 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,854 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-11 14:25:35,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:35,926 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-11 14:25:35,927 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:35,953 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:35,979 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:36,006 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:36,033 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:36,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:36,079 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 14:25:36,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,126 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-11 14:25:36,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:36,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:36,173 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 14:25:36,209 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,211 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,217 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-11 14:25:36,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:36,265 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-11 14:25:36,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 14:25:36,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,308 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,308 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:36,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,310 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-11 14:25:36,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:36,360 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-11 14:25:36,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 14:25:36,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,396 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:36,403 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:36,404 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 45 treesize of output 125 [2019-01-11 14:25:36,404 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:36,455 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-11 14:25:36,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-11 14:25:36,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:36,481 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:36,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:36,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:25:36,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:36,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:36,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:36,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:36,554 INFO L87 Difference]: Start difference. First operand 948 states and 6467 transitions. Second operand 12 states. [2019-01-11 14:25:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:37,911 INFO L93 Difference]: Finished difference Result 1059 states and 6958 transitions. [2019-01-11 14:25:37,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:25:37,911 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:25:37,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:37,915 INFO L225 Difference]: With dead ends: 1059 [2019-01-11 14:25:37,915 INFO L226 Difference]: Without dead ends: 1057 [2019-01-11 14:25:37,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:25:37,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-01-11 14:25:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 945. [2019-01-11 14:25:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-01-11 14:25:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 6457 transitions. [2019-01-11 14:25:38,300 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 6457 transitions. Word has length 6 [2019-01-11 14:25:38,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:38,300 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 6457 transitions. [2019-01-11 14:25:38,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 6457 transitions. [2019-01-11 14:25:38,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:38,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:38,302 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:38,302 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:38,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:38,302 INFO L82 PathProgramCache]: Analyzing trace with hash 908367452, now seen corresponding path program 1 times [2019-01-11 14:25:38,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:38,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:38,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:38,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:38,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:38,447 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-11 14:25:38,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:38,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:38,481 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:38,481 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:38,481 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [27] [2019-01-11 14:25:38,482 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:38,483 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:38,485 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:38,485 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:25:38,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:38,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:38,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:38,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:38,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:38,493 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:38,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:38,516 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 21 treesize of output 24 [2019-01-11 14:25:38,520 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 24 treesize of output 30 [2019-01-11 14:25:38,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,524 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 26 treesize of output 40 [2019-01-11 14:25:38,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,532 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 28 treesize of output 54 [2019-01-11 14:25:38,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:25:38,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:25:38,551 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:38,579 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:38,602 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:38,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:38,636 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:38,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:38,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,681 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:25:38,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:25:38,748 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,750 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:25:38,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:25:38,804 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:38,821 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:38,837 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:38,853 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:38,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:38,886 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-11 14:25:38,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:38,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:25:38,956 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:39,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:39,007 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 14:25:39,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 14:25:39,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:39,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:39,076 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:38 [2019-01-11 14:25:39,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,112 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:39,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 14:25:39,114 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:39,150 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-11 14:25:39,151 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-11 14:25:39,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:39,190 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:39,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-11 14:25:39,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:39,226 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-11 14:25:39,226 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:25:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:39,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:39,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:39,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:25:39,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:39,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:39,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:39,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:25:39,331 INFO L87 Difference]: Start difference. First operand 945 states and 6457 transitions. Second operand 12 states. [2019-01-11 14:25:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:41,408 INFO L93 Difference]: Finished difference Result 1044 states and 6871 transitions. [2019-01-11 14:25:41,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:25:41,408 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:25:41,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:41,412 INFO L225 Difference]: With dead ends: 1044 [2019-01-11 14:25:41,412 INFO L226 Difference]: Without dead ends: 1042 [2019-01-11 14:25:41,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:25:41,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2019-01-11 14:25:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 982. [2019-01-11 14:25:41,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2019-01-11 14:25:41,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 6716 transitions. [2019-01-11 14:25:41,815 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 6716 transitions. Word has length 6 [2019-01-11 14:25:41,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:41,815 INFO L480 AbstractCegarLoop]: Abstraction has 982 states and 6716 transitions. [2019-01-11 14:25:41,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:41,815 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 6716 transitions. [2019-01-11 14:25:41,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:41,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:41,817 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:41,817 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:41,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:41,818 INFO L82 PathProgramCache]: Analyzing trace with hash 908371606, now seen corresponding path program 2 times [2019-01-11 14:25:41,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:41,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:41,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:41,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:41,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:41,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:41,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:41,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:25:41,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:25:41,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:41,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:42,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:25:42,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:25:42,014 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:25:42,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:25:42,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:42,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,040 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-11 14:25:42,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,084 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-11 14:25:42,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:25:42,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,191 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,192 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-11 14:25:42,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,264 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-11 14:25:42,265 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,293 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,320 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,348 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,376 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,413 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 21 treesize of output 24 [2019-01-11 14:25:42,417 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 24 treesize of output 30 [2019-01-11 14:25:42,420 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 26 treesize of output 40 [2019-01-11 14:25:42,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:25:42,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:25:42,428 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:25:42,429 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,463 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,484 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,501 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,514 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,527 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:42,573 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 14:25:42,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,617 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-11 14:25:42,618 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:42,665 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 14:25:42,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,711 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-11 14:25:42,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,759 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:42,760 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 14:25:42,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,807 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:42,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, 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 123 [2019-01-11 14:25:42,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,860 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-11 14:25:42,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-11 14:25:42,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,903 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:42,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:42,905 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-11 14:25:42,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:42,954 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-11 14:25:42,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-11 14:25:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:43,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:43,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:43,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:43,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:25:43,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:43,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:43,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:43,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:25:43,238 INFO L87 Difference]: Start difference. First operand 982 states and 6716 transitions. Second operand 12 states. [2019-01-11 14:25:44,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:44,556 INFO L93 Difference]: Finished difference Result 1044 states and 6839 transitions. [2019-01-11 14:25:44,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:25:44,557 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:25:44,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:44,561 INFO L225 Difference]: With dead ends: 1044 [2019-01-11 14:25:44,561 INFO L226 Difference]: Without dead ends: 1041 [2019-01-11 14:25:44,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:25:44,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2019-01-11 14:25:44,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 980. [2019-01-11 14:25:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 980 states. [2019-01-11 14:25:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 980 states to 980 states and 6702 transitions. [2019-01-11 14:25:44,992 INFO L78 Accepts]: Start accepts. Automaton has 980 states and 6702 transitions. Word has length 6 [2019-01-11 14:25:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:44,992 INFO L480 AbstractCegarLoop]: Abstraction has 980 states and 6702 transitions. [2019-01-11 14:25:44,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 980 states and 6702 transitions. [2019-01-11 14:25:44,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:44,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:44,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:44,994 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:44,995 INFO L82 PathProgramCache]: Analyzing trace with hash 908017958, now seen corresponding path program 1 times [2019-01-11 14:25:44,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:44,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:44,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:25:44,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:44,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:45,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:45,084 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:45,084 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:45,084 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [27] [2019-01-11 14:25:45,085 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:45,085 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:45,087 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:45,087 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:25:45,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:45,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:45,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:45,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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:45,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:45,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:45,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:45,144 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 21 treesize of output 24 [2019-01-11 14:25:45,147 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 24 treesize of output 30 [2019-01-11 14:25:45,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,152 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,153 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 26 treesize of output 40 [2019-01-11 14:25:45,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,161 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 28 treesize of output 54 [2019-01-11 14:25:45,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:25:45,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:25:45,180 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,210 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,231 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,247 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,261 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:25:45,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:25:45,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:25:45,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:25:45,424 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,460 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,476 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,493 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:45,526 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:45,527 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 14:25:45,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 14:25:45,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:25:45,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:25:45,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:106 [2019-01-11 14:25:45,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:45,869 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:45,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 93 [2019-01-11 14:25:45,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:25:46,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,035 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:46,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 80 [2019-01-11 14:25:46,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:46,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-01-11 14:25:46,126 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:135 [2019-01-11 14:25:46,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,265 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 2 case distinctions, treesize of input 57 treesize of output 95 [2019-01-11 14:25:46,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:25:46,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,437 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,438 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,445 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,445 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 93 [2019-01-11 14:25:46,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:46,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 86 [2019-01-11 14:25:46,577 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:46,674 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 3 dim-1 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2019-01-11 14:25:46,675 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 14 variables, input treesize:165, output treesize:147 [2019-01-11 14:25:46,805 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-11 14:25:46,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,825 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 102 [2019-01-11 14:25:46,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:46,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,967 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:46,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:46,985 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 4 case distinctions, treesize of input 51 treesize of output 118 [2019-01-11 14:25:46,986 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2019-01-11 14:25:47,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,252 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,253 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,261 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:47,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 92 [2019-01-11 14:25:47,262 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:47,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:47,431 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:47,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 98 [2019-01-11 14:25:47,433 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:47,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 17 dim-0 vars, 4 dim-1 vars, End of recursive call: 25 dim-0 vars, and 6 xjuncts. [2019-01-11 14:25:47,576 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 21 variables, input treesize:190, output treesize:230 [2019-01-11 14:25:47,795 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 103 [2019-01-11 14:25:47,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:47,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:47,900 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:47,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:47,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:25:47,920 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:47,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:47,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:47,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:25:47,921 INFO L87 Difference]: Start difference. First operand 980 states and 6702 transitions. Second operand 12 states. [2019-01-11 14:25:48,124 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2019-01-11 14:25:48,408 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-11 14:25:48,809 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-01-11 14:25:49,238 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-01-11 14:25:49,714 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-01-11 14:25:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:50,569 INFO L93 Difference]: Finished difference Result 1104 states and 7131 transitions. [2019-01-11 14:25:50,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:25:50,570 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:25:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:50,574 INFO L225 Difference]: With dead ends: 1104 [2019-01-11 14:25:50,574 INFO L226 Difference]: Without dead ends: 1102 [2019-01-11 14:25:50,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2019-01-11 14:25:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2019-01-11 14:25:50,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 984. [2019-01-11 14:25:50,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-01-11 14:25:50,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 6730 transitions. [2019-01-11 14:25:50,991 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 6730 transitions. Word has length 6 [2019-01-11 14:25:50,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:50,991 INFO L480 AbstractCegarLoop]: Abstraction has 984 states and 6730 transitions. [2019-01-11 14:25:50,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 6730 transitions. [2019-01-11 14:25:50,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:50,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:50,993 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:50,993 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:50,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:50,993 INFO L82 PathProgramCache]: Analyzing trace with hash 908017524, now seen corresponding path program 1 times [2019-01-11 14:25:50,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:50,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:50,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:50,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:50,994 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:51,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:51,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:51,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:51,087 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:51,087 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [27] [2019-01-11 14:25:51,087 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:51,087 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:51,089 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:51,089 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:25:51,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:51,089 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:51,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:51,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:51,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:51,099 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:51,105 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:51,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,128 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:25:51,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:25:51,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,198 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,200 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,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 32 treesize of output 61 [2019-01-11 14:25:51,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:25:51,251 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,272 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,292 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,342 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 21 treesize of output 24 [2019-01-11 14:25:51,344 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 24 treesize of output 30 [2019-01-11 14:25:51,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:25:51,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:25:51,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:25:51,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:25:51,358 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,384 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,403 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,418 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,431 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,442 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:51,473 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 14:25:51,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:25:51,532 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:51,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:25:51,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,589 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:51,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:25:51,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:51,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:60, output treesize:42 [2019-01-11 14:25:51,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 14:25:51,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,682 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-11 14:25:51,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-11 14:25:51,704 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,705 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,714 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:51,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:51,716 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 14:25:51,717 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:51,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:51,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:34 [2019-01-11 14:25:51,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:51,772 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:51,817 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:25:51,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:51,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:25:51,835 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:51,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:25:51,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:25:51,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:25:51,835 INFO L87 Difference]: Start difference. First operand 984 states and 6730 transitions. Second operand 12 states. [2019-01-11 14:25:54,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:54,236 INFO L93 Difference]: Finished difference Result 1313 states and 8698 transitions. [2019-01-11 14:25:54,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:25:54,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:25:54,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:54,243 INFO L225 Difference]: With dead ends: 1313 [2019-01-11 14:25:54,243 INFO L226 Difference]: Without dead ends: 1312 [2019-01-11 14:25:54,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=215, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:25:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2019-01-11 14:25:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 839. [2019-01-11 14:25:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-01-11 14:25:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 5721 transitions. [2019-01-11 14:25:54,644 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 5721 transitions. Word has length 6 [2019-01-11 14:25:54,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:54,644 INFO L480 AbstractCegarLoop]: Abstraction has 839 states and 5721 transitions. [2019-01-11 14:25:54,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:25:54,644 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 5721 transitions. [2019-01-11 14:25:54,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:54,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:54,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:54,646 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:54,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:54,646 INFO L82 PathProgramCache]: Analyzing trace with hash 908550478, now seen corresponding path program 1 times [2019-01-11 14:25:54,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:54,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:54,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:54,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:54,647 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:54,713 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-11 14:25:54,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:54,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:54,714 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:54,714 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [24], [28], [29] [2019-01-11 14:25:54,714 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:54,714 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:54,716 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:54,716 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:25:54,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:54,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:54,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:54,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:54,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:54,732 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:54,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:54,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:54,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:25:54,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:25:54,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,894 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 26 treesize of output 36 [2019-01-11 14:25:54,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,953 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 28 treesize of output 50 [2019-01-11 14:25:54,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,960 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:25:54,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,968 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:54,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:25:54,971 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:55,494 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:55,783 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:55,974 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:56,127 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:56,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:56,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:25:56,728 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-11 14:25:56,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,735 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 53 treesize of output 63 [2019-01-11 14:25:56,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:25:56,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,822 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:25:56,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:56,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:25:56,894 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:56,917 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:56,940 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:56,963 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:56,987 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:57,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:57,029 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 14:25:57,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,062 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 41 treesize of output 93 [2019-01-11 14:25:57,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:57,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:57,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 14:25:57,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,139 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-01-11 14:25:57,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:57,183 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-11 14:25:57,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-11 14:25:57,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,276 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:57,277 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:57,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 119 [2019-01-11 14:25:57,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:57,324 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-11 14:25:57,324 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:45 [2019-01-11 14:25:57,347 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-11 14:25:57,347 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:57,386 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-11 14:25:57,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:57,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:25:57,403 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:57,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:25:57,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:25:57,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:25:57,404 INFO L87 Difference]: Start difference. First operand 839 states and 5721 transitions. Second operand 10 states. [2019-01-11 14:25:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:25:58,339 INFO L93 Difference]: Finished difference Result 881 states and 5780 transitions. [2019-01-11 14:25:58,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:25:58,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:25:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:25:58,342 INFO L225 Difference]: With dead ends: 881 [2019-01-11 14:25:58,342 INFO L226 Difference]: Without dead ends: 880 [2019-01-11 14:25:58,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:25:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2019-01-11 14:25:58,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 841. [2019-01-11 14:25:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-01-11 14:25:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 5735 transitions. [2019-01-11 14:25:58,739 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 5735 transitions. Word has length 6 [2019-01-11 14:25:58,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:25:58,739 INFO L480 AbstractCegarLoop]: Abstraction has 841 states and 5735 transitions. [2019-01-11 14:25:58,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:25:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 5735 transitions. [2019-01-11 14:25:58,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:25:58,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:25:58,741 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:25:58,741 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:25:58,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:58,741 INFO L82 PathProgramCache]: Analyzing trace with hash 908133404, now seen corresponding path program 1 times [2019-01-11 14:25:58,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:25:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:58,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:58,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:25:58,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:25:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:58,811 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-11 14:25:58,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:58,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:25:58,812 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:25:58,812 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [22], [28], [29] [2019-01-11 14:25:58,813 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:25:58,813 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:25:58,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:25:58,815 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:25:58,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:25:58,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:25:58,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:25:58,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:25:58,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:25:58,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:25:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:25:58,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:25:58,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:25:58,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:25:58,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,849 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 26 treesize of output 36 [2019-01-11 14:25:58,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,855 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 28 treesize of output 50 [2019-01-11 14:25:58,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:58,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:25:58,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:25:58,879 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,905 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,925 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,941 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,953 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,965 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:58,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:25:58,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:25:59,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:25:59,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:25:59,082 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:59,096 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:59,109 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:59,125 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:25:59,172 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-11 14:25:59,173 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 14:25:59,210 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,210 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 68 [2019-01-11 14:25:59,210 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:59,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:59,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:46 [2019-01-11 14:25:59,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,255 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,262 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:25:59,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:25:59,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:25:59,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:72 [2019-01-11 14:25:59,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:25:59,411 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:25:59,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, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 77 [2019-01-11 14:25:59,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:25:59,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:25:59,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:27 [2019-01-11 14:25:59,536 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-11 14:25:59,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:25:59,559 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-11 14:25:59,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:25:59,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:25:59,577 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:25:59,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:25:59,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:25:59,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:25:59,578 INFO L87 Difference]: Start difference. First operand 841 states and 5735 transitions. Second operand 10 states. [2019-01-11 14:26:00,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:00,772 INFO L93 Difference]: Finished difference Result 1415 states and 9444 transitions. [2019-01-11 14:26:00,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:26:00,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:26:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:00,777 INFO L225 Difference]: With dead ends: 1415 [2019-01-11 14:26:00,777 INFO L226 Difference]: Without dead ends: 1413 [2019-01-11 14:26:00,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:26:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2019-01-11 14:26:01,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1280. [2019-01-11 14:26:01,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1280 states. [2019-01-11 14:26:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 8838 transitions. [2019-01-11 14:26:01,465 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 8838 transitions. Word has length 6 [2019-01-11 14:26:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:01,465 INFO L480 AbstractCegarLoop]: Abstraction has 1280 states and 8838 transitions. [2019-01-11 14:26:01,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:26:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 8838 transitions. [2019-01-11 14:26:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:26:01,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:01,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:26:01,468 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:01,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:01,468 INFO L82 PathProgramCache]: Analyzing trace with hash 909988134, now seen corresponding path program 1 times [2019-01-11 14:26:01,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:01,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:01,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:01,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:01,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:01,537 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-11 14:26:01,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:01,538 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:01,538 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:26:01,538 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [29] [2019-01-11 14:26:01,539 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:01,539 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:01,540 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:01,540 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:26:01,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:01,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:01,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:01,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:01,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:01,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:01,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:01,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:26:01,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:01,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:01,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:26:01,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:01,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:01,614 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:01,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:01,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:26:01,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:01,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:01,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:01,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:01,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:01,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:01,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:26:01,661 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:01,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:01,690 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:01,706 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:01,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:26:01,731 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:26:01,735 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:26:01,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:26:01,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:26:01,750 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:26:01,750 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:01,774 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:01,792 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:01,806 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:01,817 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:01,828 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:01,856 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-11 14:26:01,857 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 14:26:02,056 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-11 14:26:02,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:02,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 10 case distinctions, treesize of input 41 treesize of output 87 [2019-01-11 14:26:02,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 32 xjuncts. [2019-01-11 14:26:02,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 21 dim-0 vars, and 7 xjuncts. [2019-01-11 14:26:02,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:389 [2019-01-11 14:26:02,847 WARN L181 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 86 [2019-01-11 14:26:02,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:02,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:02,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:02,854 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:02,855 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 57 [2019-01-11 14:26:02,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:02,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:02,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:02,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:02,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:02,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:02,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:02,944 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:02,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 87 [2019-01-11 14:26:02,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-11 14:26:03,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,093 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,095 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,099 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:03,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 93 [2019-01-11 14:26:03,108 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-11 14:26:03,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-1 vars, End of recursive call: 12 dim-0 vars, and 5 xjuncts. [2019-01-11 14:26:03,282 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 11 variables, input treesize:186, output treesize:180 [2019-01-11 14:26:03,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 77 [2019-01-11 14:26:03,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:03,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,457 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:03,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 57 [2019-01-11 14:26:03,458 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:03,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:03,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 67 [2019-01-11 14:26:03,517 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:03,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-1 vars, End of recursive call: 9 dim-0 vars, and 3 xjuncts. [2019-01-11 14:26:03,566 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 12 variables, input treesize:132, output treesize:92 [2019-01-11 14:26:03,649 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-11 14:26:03,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:03,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:03,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:26:03,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:03,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:26:03,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:26:03,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:26:03,716 INFO L87 Difference]: Start difference. First operand 1280 states and 8838 transitions. Second operand 10 states. [2019-01-11 14:26:04,162 WARN L181 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-01-11 14:26:04,794 WARN L181 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-01-11 14:26:05,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:05,645 INFO L93 Difference]: Finished difference Result 1381 states and 9127 transitions. [2019-01-11 14:26:05,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:26:05,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:26:05,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:05,649 INFO L225 Difference]: With dead ends: 1381 [2019-01-11 14:26:05,650 INFO L226 Difference]: Without dead ends: 1379 [2019-01-11 14:26:05,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:26:05,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-01-11 14:26:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1274. [2019-01-11 14:26:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-11 14:26:06,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-11 14:26:06,315 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-11 14:26:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:06,316 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-11 14:26:06,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:26:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-11 14:26:06,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:26:06,318 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:06,318 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:26:06,318 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:06,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:06,319 INFO L82 PathProgramCache]: Analyzing trace with hash 909993964, now seen corresponding path program 1 times [2019-01-11 14:26:06,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:06,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:06,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:06,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:06,319 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:06,370 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-11 14:26:06,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:06,371 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:06,371 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:26:06,371 INFO L207 CegarAbsIntRunner]: [0], [10], [24], [28], [30], [31] [2019-01-11 14:26:06,371 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:06,372 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:06,373 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:06,373 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:26:06,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:06,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:06,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:06,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:06,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:06,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:06,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:06,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:06,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:26:06,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,418 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 14:26:06,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:26:06,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:26:06,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:26:06,602 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:06,630 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:06,654 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:06,678 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:06,704 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:06,737 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 21 treesize of output 24 [2019-01-11 14:26:06,762 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:26:06,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:26:06,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:26:06,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:26:06,776 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:26:06,776 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:06,807 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:06,824 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:06,838 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:06,848 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:06,859 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:06,901 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-11 14:26:06,901 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 14:26:06,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,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, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 93 [2019-01-11 14:26:06,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:06,966 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-11 14:26:06,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 14:26:06,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:06,997 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:07,005 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 2 case distinctions, treesize of input 43 treesize of output 112 [2019-01-11 14:26:07,006 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:26:07,147 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-11 14:26:07,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:79, output treesize:110 [2019-01-11 14:26:07,199 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-11 14:26:07,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:07,223 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-11 14:26:07,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:07,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:26:07,241 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:07,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:26:07,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:26:07,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:26:07,242 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 8 states. [2019-01-11 14:26:08,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:08,416 INFO L93 Difference]: Finished difference Result 1306 states and 8833 transitions. [2019-01-11 14:26:08,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:26:08,417 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:26:08,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:08,420 INFO L225 Difference]: With dead ends: 1306 [2019-01-11 14:26:08,421 INFO L226 Difference]: Without dead ends: 1305 [2019-01-11 14:26:08,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:26:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2019-01-11 14:26:09,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 1274. [2019-01-11 14:26:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1274 states. [2019-01-11 14:26:09,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 8796 transitions. [2019-01-11 14:26:09,105 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 8796 transitions. Word has length 6 [2019-01-11 14:26:09,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:09,105 INFO L480 AbstractCegarLoop]: Abstraction has 1274 states and 8796 transitions. [2019-01-11 14:26:09,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:26:09,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 8796 transitions. [2019-01-11 14:26:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:26:09,107 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:09,107 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:26:09,108 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:09,108 INFO L82 PathProgramCache]: Analyzing trace with hash 909980134, now seen corresponding path program 1 times [2019-01-11 14:26:09,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:09,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:09,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:09,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:09,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:09,274 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 23 [2019-01-11 14:26:09,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:09,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:09,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:09,327 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:26:09,327 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [24], [27] [2019-01-11 14:26:09,327 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:09,327 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:09,329 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:09,329 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:26:09,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:09,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:09,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:09,330 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:09,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:09,345 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:09,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:09,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:09,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,370 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-11 14:26:09,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,408 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-11 14:26:09,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 72 [2019-01-11 14:26:09,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,503 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,505 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 14:26:09,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,572 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-11 14:26:09,573 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:09,598 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:09,624 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:09,648 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:09,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:09,708 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 21 treesize of output 24 [2019-01-11 14:26:09,710 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 24 treesize of output 30 [2019-01-11 14:26:09,727 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 26 treesize of output 40 [2019-01-11 14:26:09,734 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 28 treesize of output 54 [2019-01-11 14:26:09,736 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 30 treesize of output 72 [2019-01-11 14:26:09,738 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:26:09,739 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:09,771 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:09,790 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:09,805 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:09,818 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:09,829 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:09,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:09,872 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 14:26:09,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,913 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-11 14:26:09,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:09,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:09,961 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 14:26:09,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:09,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,000 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:10,001 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-11 14:26:10,002 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:10,047 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-11 14:26:10,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:59 [2019-01-11 14:26:10,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,080 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,082 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,087 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 45 treesize of output 115 [2019-01-11 14:26:10,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:10,133 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-11 14:26:10,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:73, output treesize:51 [2019-01-11 14:26:10,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,175 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:10,175 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:10,176 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 45 treesize of output 120 [2019-01-11 14:26:10,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:10,222 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-11 14:26:10,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:49 [2019-01-11 14:26:10,250 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:10,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:10,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:10,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:26:10,329 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:10,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:26:10,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:26:10,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:26:10,329 INFO L87 Difference]: Start difference. First operand 1274 states and 8796 transitions. Second operand 12 states. [2019-01-11 14:26:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:11,865 INFO L93 Difference]: Finished difference Result 1360 states and 9097 transitions. [2019-01-11 14:26:11,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:26:11,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:26:11,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:11,871 INFO L225 Difference]: With dead ends: 1360 [2019-01-11 14:26:11,871 INFO L226 Difference]: Without dead ends: 1358 [2019-01-11 14:26:11,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:26:11,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-01-11 14:26:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1309. [2019-01-11 14:26:12,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-01-11 14:26:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 9030 transitions. [2019-01-11 14:26:12,555 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 9030 transitions. Word has length 6 [2019-01-11 14:26:12,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:12,555 INFO L480 AbstractCegarLoop]: Abstraction has 1309 states and 9030 transitions. [2019-01-11 14:26:12,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:26:12,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 9030 transitions. [2019-01-11 14:26:12,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:26:12,558 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:12,558 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:26:12,558 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:12,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:12,558 INFO L82 PathProgramCache]: Analyzing trace with hash 896939676, now seen corresponding path program 2 times [2019-01-11 14:26:12,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:12,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:12,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:12,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:12,559 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:12,823 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-11 14:26:12,860 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:12,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:12,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:12,861 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:26:12,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:26:12,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:12,861 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:12,869 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:26:12,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:26:12,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:26:12,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:26:12,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:12,901 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:12,901 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-11 14:26:12,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:12,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:12,941 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-11 14:26:12,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:12,980 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:12,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:12,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:12,983 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-11 14:26:13,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,038 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-11 14:26:13,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,098 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,099 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,100 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,102 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,105 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,105 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-11 14:26:13,106 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,132 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,499 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,558 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,619 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 21 treesize of output 24 [2019-01-11 14:26:13,621 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 24 treesize of output 30 [2019-01-11 14:26:13,624 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 26 treesize of output 40 [2019-01-11 14:26:13,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, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:26:13,630 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 30 treesize of output 72 [2019-01-11 14:26:13,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:26:13,634 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,668 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,688 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,703 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,715 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,727 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,771 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-11 14:26:13,771 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:92, output treesize:91 [2019-01-11 14:26:13,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,799 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-11 14:26:13,800 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,845 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-11 14:26:13,845 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:26:13,867 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,873 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,874 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,874 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-11 14:26:13,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:13,922 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-11 14:26:13,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:83, output treesize:57 [2019-01-11 14:26:13,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,952 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,953 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,954 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:13,955 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:13,956 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 123 [2019-01-11 14:26:13,957 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:14,002 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-11 14:26:14,003 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:67, output treesize:49 [2019-01-11 14:26:14,026 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-11 14:26:14,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:14,060 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:14,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:14,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:26:14,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:14,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:26:14,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:26:14,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:26:14,080 INFO L87 Difference]: Start difference. First operand 1309 states and 9030 transitions. Second operand 10 states. [2019-01-11 14:26:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:15,824 INFO L93 Difference]: Finished difference Result 1898 states and 12744 transitions. [2019-01-11 14:26:15,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:26:15,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:26:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:15,829 INFO L225 Difference]: With dead ends: 1898 [2019-01-11 14:26:15,829 INFO L226 Difference]: Without dead ends: 1896 [2019-01-11 14:26:15,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:26:15,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-01-11 14:26:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1669. [2019-01-11 14:26:16,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1669 states. [2019-01-11 14:26:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 11590 transitions. [2019-01-11 14:26:16,860 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 11590 transitions. Word has length 6 [2019-01-11 14:26:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:16,860 INFO L480 AbstractCegarLoop]: Abstraction has 1669 states and 11590 transitions. [2019-01-11 14:26:16,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:26:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 11590 transitions. [2019-01-11 14:26:16,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:26:16,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:16,864 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:26:16,864 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:16,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:16,865 INFO L82 PathProgramCache]: Analyzing trace with hash 897602894, now seen corresponding path program 1 times [2019-01-11 14:26:16,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:16,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:16,865 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:26:16,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:16,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:16,968 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-11 14:26:16,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-11 14:26:16,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-11 14:26:16,968 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:26:16,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-11 14:26:16,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-11 14:26:16,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-11 14:26:16,969 INFO L87 Difference]: Start difference. First operand 1669 states and 11590 transitions. Second operand 5 states. [2019-01-11 14:26:18,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:18,053 INFO L93 Difference]: Finished difference Result 1693 states and 11616 transitions. [2019-01-11 14:26:18,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:26:18,054 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-11 14:26:18,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:18,058 INFO L225 Difference]: With dead ends: 1693 [2019-01-11 14:26:18,058 INFO L226 Difference]: Without dead ends: 1692 [2019-01-11 14:26:18,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:26:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1692 states. [2019-01-11 14:26:19,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1692 to 1672. [2019-01-11 14:26:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-01-11 14:26:19,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 11593 transitions. [2019-01-11 14:26:19,087 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 11593 transitions. Word has length 6 [2019-01-11 14:26:19,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:19,087 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 11593 transitions. [2019-01-11 14:26:19,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-11 14:26:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 11593 transitions. [2019-01-11 14:26:19,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:26:19,090 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:19,090 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:26:19,090 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:19,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:19,090 INFO L82 PathProgramCache]: Analyzing trace with hash 900997082, now seen corresponding path program 1 times [2019-01-11 14:26:19,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:19,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:19,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:19,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:19,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:19,249 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-11 14:26:19,259 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-11 14:26:19,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:19,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:19,260 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:26:19,260 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [28], [30], [31] [2019-01-11 14:26:19,260 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:19,260 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:19,262 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:19,262 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:26:19,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:19,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:19,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:19,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:19,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:19,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:19,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:19,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:19,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:26:19,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:26:19,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,290 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 26 treesize of output 36 [2019-01-11 14:26:19,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,298 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 28 treesize of output 50 [2019-01-11 14:26:19,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,304 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:26:19,311 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,312 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,315 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,316 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:26:19,317 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,356 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,376 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,405 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:26:19,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,463 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 53 treesize of output 63 [2019-01-11 14:26:19,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,498 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,501 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,502 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:26:19,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:26:19,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,613 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,615 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:26:19,617 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,640 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,663 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,686 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,709 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,751 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-11 14:26:19,751 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:84, output treesize:87 [2019-01-11 14:26:19,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,772 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 41 treesize of output 93 [2019-01-11 14:26:19,772 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,814 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-11 14:26:19,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 14:26:19,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,837 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:19,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, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 99 [2019-01-11 14:26:19,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:19,886 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-11 14:26:19,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:77, output treesize:51 [2019-01-11 14:26:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:19,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:19,918 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-11 14:26:19,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:19,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:26:19,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:19,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:26:19,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:26:19,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:26:19,937 INFO L87 Difference]: Start difference. First operand 1672 states and 11593 transitions. Second operand 8 states. [2019-01-11 14:26:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:21,983 INFO L93 Difference]: Finished difference Result 2759 states and 18997 transitions. [2019-01-11 14:26:21,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:26:21,983 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 6 [2019-01-11 14:26:21,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:21,991 INFO L225 Difference]: With dead ends: 2759 [2019-01-11 14:26:21,991 INFO L226 Difference]: Without dead ends: 2757 [2019-01-11 14:26:21,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:26:21,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2019-01-11 14:26:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2639. [2019-01-11 14:26:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2639 states. [2019-01-11 14:26:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2639 states to 2639 states and 18434 transitions. [2019-01-11 14:26:23,685 INFO L78 Accepts]: Start accepts. Automaton has 2639 states and 18434 transitions. Word has length 6 [2019-01-11 14:26:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:23,685 INFO L480 AbstractCegarLoop]: Abstraction has 2639 states and 18434 transitions. [2019-01-11 14:26:23,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:26:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 2639 states and 18434 transitions. [2019-01-11 14:26:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:26:23,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:23,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:26:23,690 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:23,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:23,690 INFO L82 PathProgramCache]: Analyzing trace with hash 900629790, now seen corresponding path program 1 times [2019-01-11 14:26:23,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:23,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:23,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:23,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:23,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:23,802 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:23,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:23,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:23,803 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-11 14:26:23,803 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [27] [2019-01-11 14:26:23,804 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:23,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:23,806 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:23,806 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:26:23,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:23,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:23,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:23,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:23,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:23,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:23,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:23,858 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 21 treesize of output 24 [2019-01-11 14:26:23,861 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 24 treesize of output 30 [2019-01-11 14:26:23,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,865 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 26 treesize of output 40 [2019-01-11 14:26:23,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,871 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,873 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 28 treesize of output 54 [2019-01-11 14:26:23,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,878 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,882 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 30 treesize of output 72 [2019-01-11 14:26:23,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:23,890 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:26:23,891 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,930 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,953 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,971 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,984 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:23,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,031 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-11 14:26:24,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,068 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-11 14:26:24,108 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,111 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,112 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-11 14:26:24,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,169 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-11 14:26:24,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,236 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,239 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-11 14:26:24,240 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,265 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,289 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,314 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,339 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:24,383 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:26:24,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,418 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-11 14:26:24,418 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,461 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-11 14:26:24,462 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:26:24,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,492 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,495 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:24,495 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 105 [2019-01-11 14:26:24,496 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,538 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-11 14:26:24,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-11 14:26:24,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,567 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,568 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,578 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-11 14:26:24,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,622 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-11 14:26:24,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-11 14:26:24,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,655 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,659 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:24,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:24,661 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-11 14:26:24,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:24,710 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-11 14:26:24,710 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-11 14:26:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:24,735 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:24,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:24,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:26:24,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:24,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:26:24,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:26:24,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:26:24,804 INFO L87 Difference]: Start difference. First operand 2639 states and 18434 transitions. Second operand 12 states. [2019-01-11 14:26:28,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:28,314 INFO L93 Difference]: Finished difference Result 3636 states and 24951 transitions. [2019-01-11 14:26:28,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:26:28,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 6 [2019-01-11 14:26:28,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:28,330 INFO L225 Difference]: With dead ends: 3636 [2019-01-11 14:26:28,330 INFO L226 Difference]: Without dead ends: 3626 [2019-01-11 14:26:28,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:26:28,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3626 states. [2019-01-11 14:26:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3626 to 2790. [2019-01-11 14:26:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-01-11 14:26:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 19490 transitions. [2019-01-11 14:26:30,716 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 19490 transitions. Word has length 6 [2019-01-11 14:26:30,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:30,716 INFO L480 AbstractCegarLoop]: Abstraction has 2790 states and 19490 transitions. [2019-01-11 14:26:30,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:26:30,716 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 19490 transitions. [2019-01-11 14:26:30,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-11 14:26:30,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:30,721 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-11 14:26:30,721 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:30,721 INFO L82 PathProgramCache]: Analyzing trace with hash 900752924, now seen corresponding path program 2 times [2019-01-11 14:26:30,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:30,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:30,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:30,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:30,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:30,780 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-11 14:26:30,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:30,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:30,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:26:30,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:26:30,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:30,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:30,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:26:30,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:26:30,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:26:30,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:26:30,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:30,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:26:30,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:26:30,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,819 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 26 treesize of output 36 [2019-01-11 14:26:30,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,828 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:26:30,831 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,835 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,836 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:26:30,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:26:30,847 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:30,885 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:30,906 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:30,922 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:30,935 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:30,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:30,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:26:30,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:30,995 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 53 treesize of output 63 [2019-01-11 14:26:31,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:26:31,081 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,088 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:26:31,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,150 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,151 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:26:31,152 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:31,175 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:31,198 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:31,221 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:31,246 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:31,287 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-11 14:26:31,287 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 14:26:31,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,315 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 41 treesize of output 93 [2019-01-11 14:26:31,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:31,356 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-11 14:26:31,356 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 14:26:31,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,387 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:31,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, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 111 [2019-01-11 14:26:31,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:26:31,539 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-11 14:26:31,539 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:98 [2019-01-11 14:26:33,545 WARN L181 SmtUtils]: Spent 1.99 s on a formula simplification. DAG size of input: 60 DAG size of output: 31 [2019-01-11 14:26:33,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:33,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:33,550 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:33,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:33,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:33,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:33,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:33,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:33,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:33,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:33,557 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:33,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:26:33,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:33,593 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-11 14:26:33,593 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:54, output treesize:36 [2019-01-11 14:26:33,609 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-11 14:26:33,610 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:33,647 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-11 14:26:33,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:33,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:26:33,666 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:33,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:26:33,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:26:33,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:26:33,667 INFO L87 Difference]: Start difference. First operand 2790 states and 19490 transitions. Second operand 10 states. [2019-01-11 14:26:37,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:37,682 INFO L93 Difference]: Finished difference Result 4300 states and 29900 transitions. [2019-01-11 14:26:37,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:26:37,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-11 14:26:37,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:37,695 INFO L225 Difference]: With dead ends: 4300 [2019-01-11 14:26:37,695 INFO L226 Difference]: Without dead ends: 4298 [2019-01-11 14:26:37,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:26:37,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4298 states. [2019-01-11 14:26:41,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4298 to 4076. [2019-01-11 14:26:41,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4076 states. [2019-01-11 14:26:41,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4076 states to 4076 states and 28660 transitions. [2019-01-11 14:26:41,574 INFO L78 Accepts]: Start accepts. Automaton has 4076 states and 28660 transitions. Word has length 6 [2019-01-11 14:26:41,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:41,574 INFO L480 AbstractCegarLoop]: Abstraction has 4076 states and 28660 transitions. [2019-01-11 14:26:41,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:26:41,575 INFO L276 IsEmpty]: Start isEmpty. Operand 4076 states and 28660 transitions. [2019-01-11 14:26:41,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:26:41,580 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:41,580 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:41,580 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:41,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:41,580 INFO L82 PathProgramCache]: Analyzing trace with hash -2030611754, now seen corresponding path program 1 times [2019-01-11 14:26:41,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:41,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:26:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:41,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:41,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:41,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:41,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:41,654 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:26:41,654 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [22], [24], [28], [29] [2019-01-11 14:26:41,655 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:41,655 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:41,656 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:41,657 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:26:41,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:41,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:41,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:41,657 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:41,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:41,668 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:41,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:41,696 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 21 treesize of output 24 [2019-01-11 14:26:41,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 14:26:41,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:26:41,706 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,711 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 28 treesize of output 54 [2019-01-11 14:26:41,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,714 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,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 30 treesize of output 72 [2019-01-11 14:26:41,719 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,720 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,721 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,724 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:26:41,724 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,764 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,784 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,800 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,814 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,826 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:41,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,858 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-11 14:26:41,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,894 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-11 14:26:41,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,938 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-11 14:26:41,987 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,989 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:41,993 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-11 14:26:42,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,059 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,062 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-11 14:26:42,062 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:42,087 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:42,125 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:42,150 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:42,173 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:42,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:42,217 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 14:26:42,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,258 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-11 14:26:42,258 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:42,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:42,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 14:26:42,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,339 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-11 14:26:42,340 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:42,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:42,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-11 14:26:42,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,418 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,428 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:42,429 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 119 [2019-01-11 14:26:42,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:42,478 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-11 14:26:42,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-11 14:26:42,508 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,511 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,513 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,515 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,518 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,522 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:42,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:42,524 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-11 14:26:42,525 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:42,571 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-11 14:26:42,572 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:43 [2019-01-11 14:26:42,598 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:42,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:42,653 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:42,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:42,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 14 [2019-01-11 14:26:42,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:42,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:26:42,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:26:42,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:26:42,672 INFO L87 Difference]: Start difference. First operand 4076 states and 28660 transitions. Second operand 11 states. [2019-01-11 14:26:46,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:46,928 INFO L93 Difference]: Finished difference Result 4236 states and 29539 transitions. [2019-01-11 14:26:46,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:26:46,928 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:26:46,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:46,941 INFO L225 Difference]: With dead ends: 4236 [2019-01-11 14:26:46,941 INFO L226 Difference]: Without dead ends: 4233 [2019-01-11 14:26:46,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=251, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:26:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4233 states. [2019-01-11 14:26:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4233 to 4163. [2019-01-11 14:26:50,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4163 states. [2019-01-11 14:26:50,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4163 states to 4163 states and 29269 transitions. [2019-01-11 14:26:50,723 INFO L78 Accepts]: Start accepts. Automaton has 4163 states and 29269 transitions. Word has length 7 [2019-01-11 14:26:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:50,723 INFO L480 AbstractCegarLoop]: Abstraction has 4163 states and 29269 transitions. [2019-01-11 14:26:50,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:26:50,724 INFO L276 IsEmpty]: Start isEmpty. Operand 4163 states and 29269 transitions. [2019-01-11 14:26:50,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:26:50,729 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:50,729 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:50,729 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:50,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:50,730 INFO L82 PathProgramCache]: Analyzing trace with hash -2030621364, now seen corresponding path program 1 times [2019-01-11 14:26:50,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:50,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:50,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:50,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:50,730 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:50,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:50,833 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:50,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:50,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:50,834 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:26:50,834 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [22], [28], [29] [2019-01-11 14:26:50,837 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:50,837 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:50,839 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:50,839 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:26:50,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:50,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:50,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:50,840 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:50,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:50,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:50,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:50,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:50,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:26:50,899 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,901 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:26:50,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:26:50,988 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,992 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,993 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,994 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:50,994 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:26:50,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,027 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,043 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,066 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:26:51,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, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 14:26:51,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 9 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:26:51,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:26:51,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:26:51,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:26:51,082 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,108 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,127 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,142 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,154 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,165 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:51,196 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:72, output treesize:71 [2019-01-11 14:26:51,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:26:51,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:51,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 14:26:51,461 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-11 14:26:51,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:26:51,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:26:51,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 14:26:51,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,532 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,533 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,539 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,540 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,542 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:51,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 94 [2019-01-11 14:26:51,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,577 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-11 14:26:51,577 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:36 [2019-01-11 14:26:51,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,610 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:51,612 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:26:51,613 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:26:51,613 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:26:51,647 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-11 14:26:51,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 14:26:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:51,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:26:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:26:51,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:26:51,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:26:51,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:26:51,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:26:51,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:26:51,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:26:51,752 INFO L87 Difference]: Start difference. First operand 4163 states and 29269 transitions. Second operand 12 states. [2019-01-11 14:26:55,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:26:55,883 INFO L93 Difference]: Finished difference Result 4232 states and 29577 transitions. [2019-01-11 14:26:55,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:26:55,883 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:26:55,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:26:55,897 INFO L225 Difference]: With dead ends: 4232 [2019-01-11 14:26:55,897 INFO L226 Difference]: Without dead ends: 4231 [2019-01-11 14:26:55,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=278, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:26:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4231 states. [2019-01-11 14:26:59,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4231 to 4190. [2019-01-11 14:26:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4190 states. [2019-01-11 14:26:59,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4190 states to 4190 states and 29458 transitions. [2019-01-11 14:26:59,567 INFO L78 Accepts]: Start accepts. Automaton has 4190 states and 29458 transitions. Word has length 7 [2019-01-11 14:26:59,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:26:59,567 INFO L480 AbstractCegarLoop]: Abstraction has 4190 states and 29458 transitions. [2019-01-11 14:26:59,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:26:59,567 INFO L276 IsEmpty]: Start isEmpty. Operand 4190 states and 29458 transitions. [2019-01-11 14:26:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:26:59,573 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:26:59,573 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:26:59,574 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:26:59,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:59,574 INFO L82 PathProgramCache]: Analyzing trace with hash -2030548264, now seen corresponding path program 1 times [2019-01-11 14:26:59,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:26:59,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:59,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:59,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:26:59,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:26:59,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:59,725 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 14:26:59,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:26:59,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:59,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:26:59,765 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:26:59,765 INFO L207 CegarAbsIntRunner]: [0], [6], [18], [24], [28], [30], [31] [2019-01-11 14:26:59,766 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:26:59,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:26:59,768 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:26:59,768 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:26:59,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:26:59,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:26:59,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:26:59,768 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:26:59,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:26:59,858 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:26:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:26:59,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:26:59,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:26:59,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:59,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:59,883 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 53 treesize of output 63 [2019-01-11 14:26:59,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:59,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:59,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:59,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:59,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:26:59,974 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:59,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:59,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:59,977 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:59,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:59,983 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:26:59,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:27:00,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:27:00,055 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,094 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,122 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,151 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,219 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 21 treesize of output 24 [2019-01-11 14:27:00,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:27:00,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:27:00,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:27:00,276 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:27:00,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:27:00,295 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,326 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,344 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,358 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,369 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,380 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:00,421 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 14:27:00,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,454 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 41 treesize of output 87 [2019-01-11 14:27:00,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,494 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-11 14:27:00,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 14:27:00,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,529 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,535 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,536 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 113 [2019-01-11 14:27:00,546 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:27:00,686 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-11 14:27:00,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:98 [2019-01-11 14:27:00,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,751 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,752 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,753 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,754 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,757 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,758 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,759 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:00,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:00,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 97 [2019-01-11 14:27:00,761 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:00,793 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-11 14:27:00,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:50, output treesize:34 [2019-01-11 14:27:00,818 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-11 14:27:00,818 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:00,850 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-11 14:27:00,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:00,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:27:00,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:00,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:27:00,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:27:00,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:27:00,870 INFO L87 Difference]: Start difference. First operand 4190 states and 29458 transitions. Second operand 10 states. [2019-01-11 14:27:05,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:05,002 INFO L93 Difference]: Finished difference Result 4570 states and 31903 transitions. [2019-01-11 14:27:05,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:27:05,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:27:05,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:05,016 INFO L225 Difference]: With dead ends: 4570 [2019-01-11 14:27:05,016 INFO L226 Difference]: Without dead ends: 4569 [2019-01-11 14:27:05,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:27:05,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4569 states. [2019-01-11 14:27:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4569 to 4419. [2019-01-11 14:27:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4419 states. [2019-01-11 14:27:08,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4419 states to 4419 states and 31072 transitions. [2019-01-11 14:27:08,883 INFO L78 Accepts]: Start accepts. Automaton has 4419 states and 31072 transitions. Word has length 7 [2019-01-11 14:27:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:08,883 INFO L480 AbstractCegarLoop]: Abstraction has 4419 states and 31072 transitions. [2019-01-11 14:27:08,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:27:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4419 states and 31072 transitions. [2019-01-11 14:27:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:27:08,890 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:08,890 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:08,890 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:08,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:08,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2030561782, now seen corresponding path program 1 times [2019-01-11 14:27:08,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:08,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:08,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:08,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:08,891 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:27:09,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:09,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:09,114 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:27:09,114 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [18], [24], [28], [29] [2019-01-11 14:27:09,115 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:27:09,115 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:27:09,117 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:27:09,117 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:27:09,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:09,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:27:09,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:09,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:09,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:09,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:27:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:09,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:09,153 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:27:09,155 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 24 treesize of output 30 [2019-01-11 14:27:09,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:27:09,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:27:09,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,172 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,174 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:27:09,177 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:27:09,183 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:09,220 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:09,243 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:09,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:09,274 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:09,287 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:09,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,320 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-11 14:27:09,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,358 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-11 14:27:09,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,402 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-11 14:27:09,451 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 14:27:09,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,520 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,522 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,525 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,527 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-11 14:27:09,527 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:09,552 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:09,576 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:09,601 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:09,626 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:09,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:09,669 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 14:27:09,711 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:09,712 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-11 14:27:09,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:09,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:09,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 14:27:10,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,038 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-11 14:27:10,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:10,084 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-11 14:27:10,085 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-11 14:27:10,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,122 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,124 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,127 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,127 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:10,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,129 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-11 14:27:10,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:10,179 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-11 14:27:10,179 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:47 [2019-01-11 14:27:10,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:10,231 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:10,231 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 45 treesize of output 131 [2019-01-11 14:27:10,232 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:10,283 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-11 14:27:10,283 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:61, output treesize:47 [2019-01-11 14:27:10,311 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:10,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:10,394 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:10,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:10,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-01-11 14:27:10,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:10,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:27:10,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:27:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:27:10,413 INFO L87 Difference]: Start difference. First operand 4419 states and 31072 transitions. Second operand 12 states. [2019-01-11 14:27:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:16,311 INFO L93 Difference]: Finished difference Result 5928 states and 41521 transitions. [2019-01-11 14:27:16,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:27:16,311 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:27:16,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:16,329 INFO L225 Difference]: With dead ends: 5928 [2019-01-11 14:27:16,330 INFO L226 Difference]: Without dead ends: 5927 [2019-01-11 14:27:16,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:27:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2019-01-11 14:27:21,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5628. [2019-01-11 14:27:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-01-11 14:27:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 39710 transitions. [2019-01-11 14:27:21,512 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 39710 transitions. Word has length 7 [2019-01-11 14:27:21,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:21,512 INFO L480 AbstractCegarLoop]: Abstraction has 5628 states and 39710 transitions. [2019-01-11 14:27:21,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:27:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 39710 transitions. [2019-01-11 14:27:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:27:21,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:21,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:21,519 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:21,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2030965338, now seen corresponding path program 1 times [2019-01-11 14:27:21,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:21,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:21,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:21,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:21,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:21,645 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:27:21,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:21,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:21,646 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:27:21,646 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [28], [30], [31] [2019-01-11 14:27:21,647 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:27:21,647 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:27:21,648 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:27:21,648 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:27:21,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:21,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:27:21,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:21,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:21,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:21,657 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:27:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:21,661 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:21,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:27:21,668 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:27:21,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,675 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 26 treesize of output 36 [2019-01-11 14:27:21,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,682 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 28 treesize of output 50 [2019-01-11 14:27:21,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,689 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,690 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:27:21,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, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:27:21,699 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:21,725 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:21,743 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:21,758 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:21,771 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:21,783 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:21,805 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:27:21,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,821 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:27:21,851 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,856 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:27:21,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,895 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,898 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,900 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:21,900 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:27:21,901 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:21,915 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:21,929 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:21,944 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:21,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:21,973 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-11 14:27:22,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 62 [2019-01-11 14:27:22,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:22,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:72, output treesize:46 [2019-01-11 14:27:22,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 88 [2019-01-11 14:27:22,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:27:22,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:27:22,182 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:58, output treesize:68 [2019-01-11 14:27:22,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,232 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:22,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 101 [2019-01-11 14:27:22,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:22,297 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:22,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 73 [2019-01-11 14:27:22,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:22,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:27:22,339 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:88, output treesize:70 [2019-01-11 14:27:22,478 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-11 14:27:22,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:22,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:22,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:22,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2019-01-11 14:27:22,527 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:22,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:27:22,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:27:22,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:27:22,528 INFO L87 Difference]: Start difference. First operand 5628 states and 39710 transitions. Second operand 11 states. [2019-01-11 14:27:29,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:29,390 INFO L93 Difference]: Finished difference Result 6511 states and 45570 transitions. [2019-01-11 14:27:29,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:27:29,390 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:27:29,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:29,410 INFO L225 Difference]: With dead ends: 6511 [2019-01-11 14:27:29,410 INFO L226 Difference]: Without dead ends: 6510 [2019-01-11 14:27:29,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=201, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:27:29,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6510 states. [2019-01-11 14:27:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6510 to 6405. [2019-01-11 14:27:36,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6405 states. [2019-01-11 14:27:36,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6405 states to 6405 states and 45149 transitions. [2019-01-11 14:27:36,141 INFO L78 Accepts]: Start accepts. Automaton has 6405 states and 45149 transitions. Word has length 7 [2019-01-11 14:27:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:36,142 INFO L480 AbstractCegarLoop]: Abstraction has 6405 states and 45149 transitions. [2019-01-11 14:27:36,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:27:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 6405 states and 45149 transitions. [2019-01-11 14:27:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:27:36,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:36,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:36,150 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:36,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:36,150 INFO L82 PathProgramCache]: Analyzing trace with hash -2015785446, now seen corresponding path program 1 times [2019-01-11 14:27:36,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:36,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:36,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:36,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:36,151 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:36,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:36,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:36,479 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:27:36,479 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [22], [24], [28], [29] [2019-01-11 14:27:36,480 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:27:36,480 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:27:36,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:27:36,482 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:27:36,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:36,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:27:36,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:36,483 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:36,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:36,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:27:36,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:36,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:36,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:27:36,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,517 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,517 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 53 treesize of output 63 [2019-01-11 14:27:36,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:27:36,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:27:36,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:36,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27: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, 15 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:27:36,672 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:36,694 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:36,718 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:36,742 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:36,766 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:36,799 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 21 treesize of output 24 [2019-01-11 14:27:36,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:27:36,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:27:36,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:27:36,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:27:36,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:27:36,819 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:36,850 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:36,867 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:36,881 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:36,892 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:36,904 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:36,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:36,944 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:84, output treesize:87 [2019-01-11 14:27:37,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2019-01-11 14:27:37,014 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:37,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:37,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:76, output treesize:50 [2019-01-11 14:27:37,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,074 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,076 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,078 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,079 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 80 [2019-01-11 14:27:37,080 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:37,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:37,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:40 [2019-01-11 14:27:37,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,143 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,144 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,147 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,148 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:37,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 93 [2019-01-11 14:27:37,150 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:37,183 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-11 14:27:37,183 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:50, output treesize:34 [2019-01-11 14:27:37,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,212 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:37,224 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:27:37,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 100 [2019-01-11 14:27:37,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:37,378 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-11 14:27:37,379 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:48, output treesize:38 [2019-01-11 14:27:37,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:37,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:37,479 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:27:37,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:37,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 14:27:37,496 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:37,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:27:37,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:27:37,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:27:37,497 INFO L87 Difference]: Start difference. First operand 6405 states and 45149 transitions. Second operand 13 states. [2019-01-11 14:27:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:27:46,064 INFO L93 Difference]: Finished difference Result 7179 states and 50083 transitions. [2019-01-11 14:27:46,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-11 14:27:46,064 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 14:27:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:27:46,087 INFO L225 Difference]: With dead ends: 7179 [2019-01-11 14:27:46,087 INFO L226 Difference]: Without dead ends: 7170 [2019-01-11 14:27:46,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:27:46,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2019-01-11 14:27:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 6542. [2019-01-11 14:27:52,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-01-11 14:27:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 46140 transitions. [2019-01-11 14:27:52,820 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 46140 transitions. Word has length 7 [2019-01-11 14:27:52,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:27:52,821 INFO L480 AbstractCegarLoop]: Abstraction has 6542 states and 46140 transitions. [2019-01-11 14:27:52,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:27:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 46140 transitions. [2019-01-11 14:27:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:27:52,830 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:27:52,830 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:27:52,830 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:27:52,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:52,830 INFO L82 PathProgramCache]: Analyzing trace with hash -2015650778, now seen corresponding path program 1 times [2019-01-11 14:27:52,831 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:27:52,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:52,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:52,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:27:52,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:27:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:52,890 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-11 14:27:52,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:52,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:27:52,890 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:27:52,891 INFO L207 CegarAbsIntRunner]: [0], [18], [22], [28], [30], [32], [33] [2019-01-11 14:27:52,891 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:27:52,892 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:27:52,893 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:27:52,893 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:27:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:27:52,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:27:52,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:27:52,894 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:27:52,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:27:52,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:27:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:27:52,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:27:52,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 37 [2019-01-11 14:27:52,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2019-01-11 14:27:52,932 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2019-01-11 14:27:52,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:52,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:52,951 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:52,959 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:52,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 56 [2019-01-11 14:27:53,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 37 [2019-01-11 14:27:53,015 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:53,031 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:53,047 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:53,063 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:53,078 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:53,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:27:53,103 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:27:53,107 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:27:53,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-01-11 14:27:53,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 48 [2019-01-11 14:27:53,136 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:27:53,136 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:53,162 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:53,173 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:53,185 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:53,198 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:53,210 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:27:53,243 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-11 14:27:53,244 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 6 variables, input treesize:59, output treesize:67 [2019-01-11 14:27:53,275 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 79 [2019-01-11 14:27:53,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 8 xjuncts. [2019-01-11 14:27:53,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 20 dim-0 vars, and 8 xjuncts. [2019-01-11 14:27:53,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:333 [2019-01-11 14:27:53,761 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,763 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,765 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:27:53,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 42 [2019-01-11 14:27:53,766 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:27:53,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:27:53,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:18 [2019-01-11 14:27:53,790 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-11 14:27:53,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:27:53,801 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-11 14:27:53,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:27:53,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 8 [2019-01-11 14:27:53,818 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:27:53,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:27:53,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:27:53,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:27:53,819 INFO L87 Difference]: Start difference. First operand 6542 states and 46140 transitions. Second operand 8 states. [2019-01-11 14:28:03,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:28:03,454 INFO L93 Difference]: Finished difference Result 10441 states and 73753 transitions. [2019-01-11 14:28:03,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:28:03,454 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:28:03,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:28:03,492 INFO L225 Difference]: With dead ends: 10441 [2019-01-11 14:28:03,492 INFO L226 Difference]: Without dead ends: 10440 [2019-01-11 14:28:03,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:28:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10440 states. [2019-01-11 14:28:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10440 to 10397. [2019-01-11 14:28:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10397 states. [2019-01-11 14:28:13,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10397 states to 10397 states and 73709 transitions. [2019-01-11 14:28:13,862 INFO L78 Accepts]: Start accepts. Automaton has 10397 states and 73709 transitions. Word has length 7 [2019-01-11 14:28:13,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:28:13,862 INFO L480 AbstractCegarLoop]: Abstraction has 10397 states and 73709 transitions. [2019-01-11 14:28:13,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:28:13,862 INFO L276 IsEmpty]: Start isEmpty. Operand 10397 states and 73709 transitions. [2019-01-11 14:28:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:28:13,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:28:13,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:28:13,873 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:28:13,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:13,873 INFO L82 PathProgramCache]: Analyzing trace with hash -2014341960, now seen corresponding path program 1 times [2019-01-11 14:28:13,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:28:13,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:13,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:13,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:13,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:28:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:28:13,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:13,962 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:28:13,962 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:28:13,962 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [24], [28], [30], [31] [2019-01-11 14:28:13,963 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:28:13,963 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:28:13,965 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:28:13,965 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:28:13,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:13,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:28:13,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:13,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:28:13,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:13,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:28:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:13,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:28:13,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:28:13,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:28:13,990 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:13,991 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:13,992 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 26 treesize of output 36 [2019-01-11 14:28:13,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:13,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:13,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:13,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:28:14,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:28:14,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:28:14,017 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,053 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,072 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,088 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:28:14,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,159 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 53 treesize of output 63 [2019-01-11 14:28:14,333 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-01-11 14:28:14,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:28:14,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,394 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,395 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:28:14,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:28:14,464 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,487 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,509 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,532 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,556 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:14,597 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 14:28:14,628 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,629 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 41 treesize of output 87 [2019-01-11 14:28:14,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,668 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-11 14:28:14,668 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 14:28:14,693 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,695 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,697 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,699 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,700 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:14,700 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 43 treesize of output 102 [2019-01-11 14:28:14,701 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:14,742 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-11 14:28:14,743 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:55 [2019-01-11 14:28:14,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,772 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,773 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,774 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,777 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,778 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:14,782 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:14,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 2 case distinctions, treesize of input 45 treesize of output 108 [2019-01-11 14:28:14,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:28:14,928 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-11 14:28:14,929 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:69, output treesize:102 [2019-01-11 14:28:14,978 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-11 14:28:14,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:28:15,027 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-11 14:28:15,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:28:15,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:28:15,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:28:15,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:28:15,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:28:15,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:28:15,046 INFO L87 Difference]: Start difference. First operand 10397 states and 73709 transitions. Second operand 10 states. [2019-01-11 14:28:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:28:25,150 INFO L93 Difference]: Finished difference Result 10427 states and 73743 transitions. [2019-01-11 14:28:25,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:28:25,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:28:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:28:25,184 INFO L225 Difference]: With dead ends: 10427 [2019-01-11 14:28:25,184 INFO L226 Difference]: Without dead ends: 10426 [2019-01-11 14:28:25,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:28:25,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10426 states. [2019-01-11 14:28:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10426 to 10394. [2019-01-11 14:28:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10394 states. [2019-01-11 14:28:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10394 states to 10394 states and 73688 transitions. [2019-01-11 14:28:35,532 INFO L78 Accepts]: Start accepts. Automaton has 10394 states and 73688 transitions. Word has length 7 [2019-01-11 14:28:35,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:28:35,532 INFO L480 AbstractCegarLoop]: Abstraction has 10394 states and 73688 transitions. [2019-01-11 14:28:35,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:28:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 10394 states and 73688 transitions. [2019-01-11 14:28:35,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:28:35,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:28:35,542 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:28:35,542 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:28:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:35,543 INFO L82 PathProgramCache]: Analyzing trace with hash -2026927280, now seen corresponding path program 1 times [2019-01-11 14:28:35,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:28:35,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:35,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:35,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:35,543 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:28:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:35,695 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-11 14:28:35,738 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:35,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:35,738 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:28:35,739 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:28:35,739 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [28], [29] [2019-01-11 14:28:35,739 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:28:35,739 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:28:35,741 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:28:35,742 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:28:35,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:35,742 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:28:35,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:35,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:28:35,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:35,759 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:28:35,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:35,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:28:35,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:28:35,771 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:28:35,775 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,776 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,777 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 26 treesize of output 36 [2019-01-11 14:28:35,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,785 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 28 treesize of output 50 [2019-01-11 14:28:35,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:28:35,803 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:28:35,803 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:35,831 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:35,850 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:35,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:35,879 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:35,891 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:35,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:28:35,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:28:35,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,963 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:35,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:28:36,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:28:36,014 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:36,029 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:36,044 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:36,060 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:36,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:36,092 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-11 14:28:36,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 45 [2019-01-11 14:28:36,147 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:36,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:36,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:28:36,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,195 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:36,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 60 [2019-01-11 14:28:36,196 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:36,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:36,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:29 [2019-01-11 14:28:36,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 61 [2019-01-11 14:28:36,249 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:36,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:36,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:29 [2019-01-11 14:28:36,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:36,301 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:36,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 75 [2019-01-11 14:28:36,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:36,326 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-11 14:28:36,326 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:39, output treesize:33 [2019-01-11 14:28:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:36,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:28:36,405 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:36,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:28:36,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:28:36,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:28:36,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:28:36,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:28:36,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:28:36,426 INFO L87 Difference]: Start difference. First operand 10394 states and 73688 transitions. Second operand 12 states. [2019-01-11 14:28:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:28:47,159 INFO L93 Difference]: Finished difference Result 11408 states and 80747 transitions. [2019-01-11 14:28:47,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:28:47,159 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:28:47,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:28:47,199 INFO L225 Difference]: With dead ends: 11408 [2019-01-11 14:28:47,199 INFO L226 Difference]: Without dead ends: 11406 [2019-01-11 14:28:47,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:28:47,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11406 states. [2019-01-11 14:28:58,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11406 to 11270. [2019-01-11 14:28:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11270 states. [2019-01-11 14:28:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 80138 transitions. [2019-01-11 14:28:58,129 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 80138 transitions. Word has length 7 [2019-01-11 14:28:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:28:58,129 INFO L480 AbstractCegarLoop]: Abstraction has 11270 states and 80138 transitions. [2019-01-11 14:28:58,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:28:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 80138 transitions. [2019-01-11 14:28:58,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:28:58,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:28:58,140 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 14:28:58,140 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:28:58,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:28:58,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2023700554, now seen corresponding path program 2 times [2019-01-11 14:28:58,141 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:28:58,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:58,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:28:58,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:28:58,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:28:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:28:58,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:28:58,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:58,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:28:58,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:28:58,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:28:58,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:28:58,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:28:58,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:28:58,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:28:58,346 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-11 14:28:58,346 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:28:58,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:28:58,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:28:58,386 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 24 treesize of output 30 [2019-01-11 14:28:58,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,448 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,449 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:28:58,485 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,534 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:28:58,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,616 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,638 INFO L303 Elim1Store]: Index analysis took 102 ms [2019-01-11 14:28:58,638 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:28:58,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,728 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,729 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,730 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:28:58,731 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:58,770 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:58,790 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:58,807 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:58,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:58,834 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:58,866 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:28:58,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,905 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-11 14:28:58,945 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,946 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,947 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,948 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 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-11 14:28:58,997 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,998 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:58,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,000 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,003 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-11 14:28:59,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,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-11 14:28:59,070 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:59,094 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:59,118 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:59,143 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:59,167 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:28:59,211 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:59,211 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:28:59,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,246 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-11 14:28:59,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:59,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:59,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 14:28:59,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,317 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,318 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,323 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-11 14:28:59,323 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:59,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:59,367 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:83, output treesize:57 [2019-01-11 14:28:59,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,475 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:59,475 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 129 [2019-01-11 14:28:59,476 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:59,526 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-11 14:28:59,526 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:49 [2019-01-11 14:28:59,551 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,552 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,553 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,562 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,564 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,564 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:28:59,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,566 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-11 14:28:59,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:59,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:28:59,613 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:43 [2019-01-11 14:28:59,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,640 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,645 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,646 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,647 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,648 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,649 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,650 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,651 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,653 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,654 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,656 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:28:59,656 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 45 treesize of output 125 [2019-01-11 14:28:59,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:28:59,706 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-11 14:28:59,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:41 [2019-01-11 14:28:59,731 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:59,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:28:59,804 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:28:59,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:28:59,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2019-01-11 14:28:59,822 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:28:59,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:28:59,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:28:59,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=192, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:28:59,822 INFO L87 Difference]: Start difference. First operand 11270 states and 80138 transitions. Second operand 13 states. [2019-01-11 14:29:14,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:29:14,251 INFO L93 Difference]: Finished difference Result 14692 states and 103813 transitions. [2019-01-11 14:29:14,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-11 14:29:14,251 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 14:29:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:29:14,304 INFO L225 Difference]: With dead ends: 14692 [2019-01-11 14:29:14,304 INFO L226 Difference]: Without dead ends: 14688 [2019-01-11 14:29:14,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=243, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:29:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14688 states. [2019-01-11 14:29:27,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14688 to 12758. [2019-01-11 14:29:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12758 states. [2019-01-11 14:29:27,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12758 states to 12758 states and 90546 transitions. [2019-01-11 14:29:27,594 INFO L78 Accepts]: Start accepts. Automaton has 12758 states and 90546 transitions. Word has length 7 [2019-01-11 14:29:27,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:29:27,594 INFO L480 AbstractCegarLoop]: Abstraction has 12758 states and 90546 transitions. [2019-01-11 14:29:27,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:29:27,594 INFO L276 IsEmpty]: Start isEmpty. Operand 12758 states and 90546 transitions. [2019-01-11 14:29:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:29:27,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:29:27,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:29:27,606 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:29:27,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:29:27,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2023160096, now seen corresponding path program 1 times [2019-01-11 14:29:27,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:29:27,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:27,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:29:27,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:27,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:29:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:29:27,654 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:29:27,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:29:27,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:29:27,655 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:29:27,655 INFO L207 CegarAbsIntRunner]: [0], [14], [18], [24], [28], [30], [31] [2019-01-11 14:29:27,656 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:29:27,656 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:29:27,658 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:29:27,658 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:29:27,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:29:27,658 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:29:27,658 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:29:27,658 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:29:27,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:29:27,667 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:29:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:29:27,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:29:27,699 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:29:27,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:29:27,707 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,709 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 26 treesize of output 36 [2019-01-11 14:29:27,715 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,716 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,717 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,718 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:29:27,722 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,723 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,726 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:29:27,730 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,734 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:29:27,736 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:27,772 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:27,793 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:27,809 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:27,822 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:27,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:27,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:29:27,875 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,878 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 53 treesize of output 63 [2019-01-11 14:29:27,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,914 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:29:27,962 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,964 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,969 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:27,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, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:29:28,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,029 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,030 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,033 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:29:28,034 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:28,056 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:28,078 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:28,101 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:28,126 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:28,167 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-11 14:29:28,167 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 14:29:28,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,195 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 41 treesize of output 87 [2019-01-11 14:29:28,195 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:28,234 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-11 14:29:28,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:67 [2019-01-11 14:29:28,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,260 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,263 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 109 [2019-01-11 14:29:28,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:28,308 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-11 14:29:28,308 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:79, output treesize:53 [2019-01-11 14:29:28,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,397 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,399 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,400 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,401 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,404 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,407 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:29:28,409 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:28,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 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-11 14:29:28,410 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:28,455 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-11 14:29:28,455 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:43 [2019-01-11 14:29:28,479 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-11 14:29:28,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:29:28,512 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-11 14:29:28,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:29:28,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:29:28,530 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:29:28,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:29:28,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:29:28,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:29:28,530 INFO L87 Difference]: Start difference. First operand 12758 states and 90546 transitions. Second operand 10 states. [2019-01-11 14:29:40,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:29:40,926 INFO L93 Difference]: Finished difference Result 13016 states and 92075 transitions. [2019-01-11 14:29:40,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:29:40,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:29:40,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:29:40,973 INFO L225 Difference]: With dead ends: 13016 [2019-01-11 14:29:40,973 INFO L226 Difference]: Without dead ends: 13015 [2019-01-11 14:29:40,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=152, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:29:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13015 states. [2019-01-11 14:29:55,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13015 to 12958. [2019-01-11 14:29:55,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-11 14:29:55,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-11 14:29:55,215 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-11 14:29:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:29:55,215 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-11 14:29:55,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:29:55,215 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-11 14:29:55,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:29:55,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:29:55,228 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 14:29:55,228 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:29:55,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:29:55,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1920990370, now seen corresponding path program 1 times [2019-01-11 14:29:55,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:29:55,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:55,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:29:55,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:29:55,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:29:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:29:55,421 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 13 [2019-01-11 14:29:55,430 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-11 14:29:55,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:29:55,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:29:55,431 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:29:55,431 INFO L207 CegarAbsIntRunner]: [0], [6], [28], [30], [32], [33] [2019-01-11 14:29:55,432 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:29:55,432 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:29:55,433 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:29:55,433 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 70 root evaluator evaluations with a maximum evaluation depth of 2. Performed 70 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-11 14:29:55,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:29:55,433 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:29:55,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:29:55,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:29:55,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:29:55,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:29:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:29:55,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:29:55,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:29:55,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:29:55,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,458 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 26 treesize of output 36 [2019-01-11 14:29:55,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:29:55,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,471 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:29:55,481 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:29:55,481 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:55,507 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:55,526 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:55,541 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:55,553 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:55,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:55,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:29:55,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:29:55,631 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,633 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:29:55,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:29:55,678 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:55,693 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:55,706 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:55,721 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:29:55,750 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-11 14:29:55,750 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 6 variables, input treesize:64, output treesize:67 [2019-01-11 14:29:55,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:29:55,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:29:55,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:29:55,879 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-11 14:29:55,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:29:55,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 57 [2019-01-11 14:29:55,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:29:55,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:29:55,942 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:33 [2019-01-11 14:29:55,956 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-11 14:29:55,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:29:55,972 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-11 14:29:55,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:29:55,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 3, 3] total 8 [2019-01-11 14:29:55,989 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:29:55,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-11 14:29:55,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-11 14:29:55,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-01-11 14:29:55,990 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 7 states. [2019-01-11 14:30:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:30:08,786 INFO L93 Difference]: Finished difference Result 12974 states and 91967 transitions. [2019-01-11 14:30:08,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:30:08,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-11 14:30:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:30:08,830 INFO L225 Difference]: With dead ends: 12974 [2019-01-11 14:30:08,830 INFO L226 Difference]: Without dead ends: 12973 [2019-01-11 14:30:08,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:30:08,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12973 states. [2019-01-11 14:30:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12973 to 12958. [2019-01-11 14:30:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12958 states. [2019-01-11 14:30:21,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12958 states to 12958 states and 91946 transitions. [2019-01-11 14:30:21,809 INFO L78 Accepts]: Start accepts. Automaton has 12958 states and 91946 transitions. Word has length 7 [2019-01-11 14:30:21,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:30:21,809 INFO L480 AbstractCegarLoop]: Abstraction has 12958 states and 91946 transitions. [2019-01-11 14:30:21,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-11 14:30:21,809 INFO L276 IsEmpty]: Start isEmpty. Operand 12958 states and 91946 transitions. [2019-01-11 14:30:21,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:30:21,819 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:30:21,819 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:30:21,820 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:30:21,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:30:21,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1935645556, now seen corresponding path program 1 times [2019-01-11 14:30:21,820 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:30:21,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:30:21,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:30:21,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:30:21,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:30:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:30:21,883 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:30:21,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:30:21,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:30:21,884 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:30:21,884 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [24], [28], [30], [31] [2019-01-11 14:30:21,885 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:30:21,885 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:30:21,886 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:30:21,886 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:30:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:30:21,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:30:21,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:30:21,887 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:30:21,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:30:21,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:30:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:30:21,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:30:21,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:30:21,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:30:21,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,911 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 26 treesize of output 36 [2019-01-11 14:30:21,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,919 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 28 treesize of output 50 [2019-01-11 14:30:21,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:30:21,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:21,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:30:21,937 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:21,974 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:21,992 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:22,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:22,021 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:22,034 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:22,060 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:30:22,075 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,077 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,078 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 53 treesize of output 63 [2019-01-11 14:30:22,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,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, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:30:22,161 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,164 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:30:22,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:30:22,234 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:22,255 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:22,276 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:22,299 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:22,322 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:22,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:22,366 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 14:30:22,398 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,407 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 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 14:30:22,408 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:30:22,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:30:22,550 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-11 14:30:22,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,608 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:30:22,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:30:22,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:22,642 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-11 14:30:22,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-11 14:30:22,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:22,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 78 [2019-01-11 14:30:22,672 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:22,702 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-11 14:30:22,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-11 14:30:22,723 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-11 14:30:22,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:30:22,758 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-11 14:30:22,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:30:22,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:30:22,777 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:30:22,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:30:22,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:30:22,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:30:22,777 INFO L87 Difference]: Start difference. First operand 12958 states and 91946 transitions. Second operand 10 states. [2019-01-11 14:30:35,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:30:35,786 INFO L93 Difference]: Finished difference Result 13106 states and 92752 transitions. [2019-01-11 14:30:35,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:30:35,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:30:35,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:30:35,831 INFO L225 Difference]: With dead ends: 13106 [2019-01-11 14:30:35,831 INFO L226 Difference]: Without dead ends: 13105 [2019-01-11 14:30:35,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-01-11 14:30:35,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13105 states. [2019-01-11 14:30:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13105 to 13023. [2019-01-11 14:30:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13023 states. [2019-01-11 14:30:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13023 states to 13023 states and 92401 transitions. [2019-01-11 14:30:49,039 INFO L78 Accepts]: Start accepts. Automaton has 13023 states and 92401 transitions. Word has length 7 [2019-01-11 14:30:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:30:49,039 INFO L480 AbstractCegarLoop]: Abstraction has 13023 states and 92401 transitions. [2019-01-11 14:30:49,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:30:49,040 INFO L276 IsEmpty]: Start isEmpty. Operand 13023 states and 92401 transitions. [2019-01-11 14:30:49,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:30:49,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:30:49,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:30:49,050 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:30:49,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:30:49,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1935632038, now seen corresponding path program 1 times [2019-01-11 14:30:49,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:30:49,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:30:49,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:30:49,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:30:49,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:30:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:30:49,135 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:30:49,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:30:49,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:30:49,135 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:30:49,135 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [22], [24], [28], [29] [2019-01-11 14:30:49,136 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:30:49,136 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:30:49,138 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:30:49,138 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:30:49,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:30:49,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:30:49,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:30:49,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:30:49,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:30:49,149 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:30:49,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:30:49,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:30:49,176 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 21 treesize of output 24 [2019-01-11 14:30:49,178 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 24 treesize of output 30 [2019-01-11 14:30:49,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,182 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 26 treesize of output 40 [2019-01-11 14:30:49,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:30:49,193 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,194 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,195 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,197 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,197 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 30 treesize of output 72 [2019-01-11 14:30:49,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,203 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,206 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:30:49,206 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,245 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,267 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,284 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,311 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,344 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-11 14:30:49,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,382 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-11 14:30:49,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,427 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-11 14:30:49,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,480 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,481 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,481 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-11 14:30:49,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,544 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,548 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,549 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,549 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-11 14:30:49,550 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,574 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,599 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,623 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,646 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:49,690 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 14:30:49,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,733 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-11 14:30:49,733 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:30:49,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 14:30:49,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,817 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,821 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:30:49,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 105 [2019-01-11 14:30:49,822 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,866 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-11 14:30:49,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:59 [2019-01-11 14:30:49,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:49,927 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-11 14:30:49,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:49,972 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-11 14:30:49,973 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:69, output treesize:47 [2019-01-11 14:30:50,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,005 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,006 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,007 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,013 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,016 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,017 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:30:50,018 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:30:50,018 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 123 [2019-01-11 14:30:50,019 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:30:50,066 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-11 14:30:50,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-11 14:30:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:30:50,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:30:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:30:50,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:30:50,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-11 14:30:50,215 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:30:50,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-11 14:30:50,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-11 14:30:50,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:30:50,216 INFO L87 Difference]: Start difference. First operand 13023 states and 92401 transitions. Second operand 12 states. [2019-01-11 14:31:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:31:03,440 INFO L93 Difference]: Finished difference Result 13278 states and 93926 transitions. [2019-01-11 14:31:03,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:31:03,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 7 [2019-01-11 14:31:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:31:03,484 INFO L225 Difference]: With dead ends: 13278 [2019-01-11 14:31:03,484 INFO L226 Difference]: Without dead ends: 13277 [2019-01-11 14:31:03,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:31:03,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13277 states. [2019-01-11 14:31:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13277 to 13233. [2019-01-11 14:31:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13233 states. [2019-01-11 14:31:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13233 states to 13233 states and 93871 transitions. [2019-01-11 14:31:17,565 INFO L78 Accepts]: Start accepts. Automaton has 13233 states and 93871 transitions. Word has length 7 [2019-01-11 14:31:17,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:31:17,566 INFO L480 AbstractCegarLoop]: Abstraction has 13233 states and 93871 transitions. [2019-01-11 14:31:17,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-11 14:31:17,566 INFO L276 IsEmpty]: Start isEmpty. Operand 13233 states and 93871 transitions. [2019-01-11 14:31:17,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:31:17,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:31:17,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:31:17,577 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:31:17,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:31:17,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1935214964, now seen corresponding path program 1 times [2019-01-11 14:31:17,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:31:17,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:31:17,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:31:17,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:31:17,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:31:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:31:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:31:17,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:31:17,748 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:31:17,748 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:31:17,748 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [14], [22], [28], [29] [2019-01-11 14:31:17,749 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:31:17,749 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:31:17,751 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:31:17,751 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 4 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-11 14:31:17,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:31:17,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:31:17,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:31:17,752 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:31:17,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:31:17,761 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:31:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:31:17,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:31:17,789 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 21 treesize of output 24 [2019-01-11 14:31:17,791 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 24 treesize of output 30 [2019-01-11 14:31:17,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:17,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:17,796 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 26 treesize of output 40 [2019-01-11 14:31:17,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:17,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:17,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:17,803 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:31:17,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:17,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:17,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:17,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:17,809 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 30 treesize of output 72 [2019-01-11 14:31:17,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:31:17,817 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:17,844 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:17,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:17,882 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:17,896 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:17,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:17,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:17,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:31:17,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:17,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:17,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:31:18,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,002 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,003 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,004 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:31:18,044 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,049 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:31:18,050 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:18,066 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:18,079 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:18,094 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:18,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:31:18,125 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 14:31:18,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:31:18,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:18,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:31:18,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:76, output treesize:50 [2019-01-11 14:31:18,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,237 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,238 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,241 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:31:18,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:31:18,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:18,272 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-11 14:31:18,273 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:60, output treesize:42 [2019-01-11 14:31:18,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:31:18,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:18,336 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-11 14:31:18,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:34 [2019-01-11 14:31:18,360 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,361 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,364 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,371 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:18,371 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:31:18,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 98 [2019-01-11 14:31:18,373 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:18,405 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-11 14:31:18,405 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:46, output treesize:40 [2019-01-11 14:31:18,430 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:31:18,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:31:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:31:18,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:31:18,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2019-01-11 14:31:18,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:31:18,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:31:18,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:31:18,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:31:18,502 INFO L87 Difference]: Start difference. First operand 13233 states and 93871 transitions. Second operand 13 states. [2019-01-11 14:31:34,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:31:34,583 INFO L93 Difference]: Finished difference Result 17581 states and 124519 transitions. [2019-01-11 14:31:34,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:31:34,584 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 14:31:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:31:34,646 INFO L225 Difference]: With dead ends: 17581 [2019-01-11 14:31:34,647 INFO L226 Difference]: Without dead ends: 17580 [2019-01-11 14:31:34,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2019-01-11 14:31:34,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17580 states. [2019-01-11 14:31:45,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17580 to 9927. [2019-01-11 14:31:45,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-11 14:31:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-11 14:31:45,214 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-11 14:31:45,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:31:45,214 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-11 14:31:45,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:31:45,215 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-11 14:31:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:31:45,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:31:45,223 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:31:45,223 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:31:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:31:45,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1935766706, now seen corresponding path program 1 times [2019-01-11 14:31:45,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:31:45,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:31:45,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:31:45,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:31:45,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:31:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:31:45,286 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-11 14:31:45,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:31:45,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:31:45,286 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:31:45,287 INFO L207 CegarAbsIntRunner]: [0], [6], [22], [28], [30], [32], [33] [2019-01-11 14:31:45,287 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:31:45,288 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:31:45,289 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:31:45,289 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:31:45,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:31:45,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:31:45,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:31:45,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:31:45,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:31:45,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:31:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:31:45,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:31:45,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:31:45,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:31:45,313 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,314 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:31:45,320 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,321 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,322 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,322 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:31:45,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,330 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:31:45,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:31:45,343 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:45,381 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:45,401 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:45,417 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:45,430 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:45,443 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:45,468 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:31:45,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,487 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,487 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 53 treesize of output 63 [2019-01-11 14:31:45,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,524 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,526 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,527 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:31:45,571 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,572 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,573 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:31:45,634 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,635 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,636 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,637 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:31:45,644 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:45,667 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:45,689 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:45,712 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:45,736 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:31:45,777 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-11 14:31:45,777 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 14:31:45,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:45,812 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 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 14:31:45,813 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:31:45,950 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-11 14:31:45,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-11 14:31:46,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:46,010 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:31:46,011 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:31:46,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:31:46,012 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:31:46,042 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-11 14:31:46,042 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:76, output treesize:42 [2019-01-11 14:31:46,063 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-11 14:31:46,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:31:46,084 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-11 14:31:46,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:31:46,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:31:46,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:31:46,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:31:46,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:31:46,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:31:46,103 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 8 states. [2019-01-11 14:31:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:31:56,128 INFO L93 Difference]: Finished difference Result 9947 states and 70395 transitions. [2019-01-11 14:31:56,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:31:56,129 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:31:56,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:31:56,163 INFO L225 Difference]: With dead ends: 9947 [2019-01-11 14:31:56,163 INFO L226 Difference]: Without dead ends: 9946 [2019-01-11 14:31:56,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:31:56,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9946 states. [2019-01-11 14:32:07,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9946 to 9927. [2019-01-11 14:32:07,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9927 states. [2019-01-11 14:32:07,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9927 states to 9927 states and 70376 transitions. [2019-01-11 14:32:07,301 INFO L78 Accepts]: Start accepts. Automaton has 9927 states and 70376 transitions. Word has length 7 [2019-01-11 14:32:07,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:32:07,302 INFO L480 AbstractCegarLoop]: Abstraction has 9927 states and 70376 transitions. [2019-01-11 14:32:07,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:32:07,302 INFO L276 IsEmpty]: Start isEmpty. Operand 9927 states and 70376 transitions. [2019-01-11 14:32:07,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:32:07,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:32:07,310 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-11 14:32:07,310 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:32:07,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:32:07,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1937303618, now seen corresponding path program 3 times [2019-01-11 14:32:07,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:32:07,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:07,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:32:07,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:07,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:32:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:32:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:32:07,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:07,384 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:32:07,384 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:32:07,385 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:32:07,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:07,385 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:32:07,396 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-11 14:32:07,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-11 14:32:07,400 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-11 14:32:07,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:32:07,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:32:07,422 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 21 treesize of output 24 [2019-01-11 14:32:07,424 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 24 treesize of output 30 [2019-01-11 14:32:07,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 40 [2019-01-11 14:32:07,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,435 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 28 treesize of output 54 [2019-01-11 14:32:07,440 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,441 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,442 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,444 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,445 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 30 treesize of output 72 [2019-01-11 14:32:07,454 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 71 [2019-01-11 14:32:07,454 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:07,481 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:07,503 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:07,520 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:07,534 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:07,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:07,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2019-01-11 14:32:07,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,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, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 53 [2019-01-11 14:32:07,638 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,641 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 61 [2019-01-11 14:32:07,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 41 [2019-01-11 14:32:07,689 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:07,705 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:07,719 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:07,735 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:07,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:07,766 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:72, output treesize:71 [2019-01-11 14:32:07,865 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:07,873 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 81 [2019-01-11 14:32:07,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:32:07,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-01-11 14:32:07,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:109 [2019-01-11 14:32:08,083 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,084 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,085 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,086 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,087 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:08,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 72 [2019-01-11 14:32:08,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:08,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,162 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,167 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,170 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,201 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 8 case distinctions, treesize of input 65 treesize of output 107 [2019-01-11 14:32:08,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 16 xjuncts. [2019-01-11 14:32:08,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 13 dim-0 vars, and 6 xjuncts. [2019-01-11 14:32:08,508 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:126, output treesize:280 [2019-01-11 14:32:08,652 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 92 [2019-01-11 14:32:08,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,660 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,665 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,668 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:08,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 93 [2019-01-11 14:32:08,669 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:08,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,800 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,801 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,802 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,803 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-11 14:32:08,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:08,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,934 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,936 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,937 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,938 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,939 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,940 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,941 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,942 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:08,943 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:08,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 113 [2019-01-11 14:32:08,944 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:09,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 66 [2019-01-11 14:32:09,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:09,146 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-1 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-01-11 14:32:09,146 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:227, output treesize:161 [2019-01-11 14:32:09,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 78 [2019-01-11 14:32:09,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:09,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,338 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,342 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,343 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,344 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,345 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,348 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,349 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,350 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 98 [2019-01-11 14:32:09,352 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:09,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,467 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,468 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,469 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,470 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,471 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,472 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,473 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,474 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,475 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,478 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,479 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 108 [2019-01-11 14:32:09,480 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:09,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,591 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,592 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,593 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,598 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,600 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,601 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,605 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 100 [2019-01-11 14:32:09,605 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:09,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 4 dim-1 vars, End of recursive call: 12 dim-0 vars, and 4 xjuncts. [2019-01-11 14:32:09,699 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 16 variables, input treesize:209, output treesize:153 [2019-01-11 14:32:09,781 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,782 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,783 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,784 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,786 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,787 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,788 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,791 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,792 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,793 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,797 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,798 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:09,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 123 [2019-01-11 14:32:09,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:09,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,922 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,924 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,925 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,926 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,928 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,929 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,930 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,931 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:09,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 118 [2019-01-11 14:32:09,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:10,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,055 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,057 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,058 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,061 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,062 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,063 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,064 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,066 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,068 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,069 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:10,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 125 [2019-01-11 14:32:10,071 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:10,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:10,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 88 [2019-01-11 14:32:10,187 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:10,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-1 vars, End of recursive call: 16 dim-0 vars, and 4 xjuncts. [2019-01-11 14:32:10,264 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 20 variables, input treesize:201, output treesize:141 [2019-01-11 14:32:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:32:10,356 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:32:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:32:10,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:32:10,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2019-01-11 14:32:10,526 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:32:10,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-11 14:32:10,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-11 14:32:10,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:32:10,527 INFO L87 Difference]: Start difference. First operand 9927 states and 70376 transitions. Second operand 13 states. [2019-01-11 14:32:10,727 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-01-11 14:32:11,003 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 36 [2019-01-11 14:32:12,471 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 78 [2019-01-11 14:32:14,003 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-01-11 14:32:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:32:25,809 INFO L93 Difference]: Finished difference Result 12394 states and 87417 transitions. [2019-01-11 14:32:25,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-11 14:32:25,810 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 7 [2019-01-11 14:32:25,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:32:25,853 INFO L225 Difference]: With dead ends: 12394 [2019-01-11 14:32:25,853 INFO L226 Difference]: Without dead ends: 12392 [2019-01-11 14:32:25,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=210, Invalid=546, Unknown=0, NotChecked=0, Total=756 [2019-01-11 14:32:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12392 states. [2019-01-11 14:32:34,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12392 to 7195. [2019-01-11 14:32:34,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7195 states. [2019-01-11 14:32:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7195 states to 7195 states and 51194 transitions. [2019-01-11 14:32:34,740 INFO L78 Accepts]: Start accepts. Automaton has 7195 states and 51194 transitions. Word has length 7 [2019-01-11 14:32:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:32:34,740 INFO L480 AbstractCegarLoop]: Abstraction has 7195 states and 51194 transitions. [2019-01-11 14:32:34,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-11 14:32:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 7195 states and 51194 transitions. [2019-01-11 14:32:34,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:32:34,746 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:32:34,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:32:34,746 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:32:34,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:32:34,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1937075524, now seen corresponding path program 1 times [2019-01-11 14:32:34,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:32:34,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:34,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:32:34,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:34,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:32:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:32:34,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:32:34,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:34,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:32:34,832 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:32:34,832 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [24], [28], [30], [31] [2019-01-11 14:32:34,833 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:32:34,833 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:32:34,835 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:32:34,835 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:32:34,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:32:34,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:32:34,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:34,836 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:32:34,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:32:34,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:32:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:32:34,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:32:34,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:32:34,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:32:34,862 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,864 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,864 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 26 treesize of output 36 [2019-01-11 14:32:34,869 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,870 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,872 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,872 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 28 treesize of output 50 [2019-01-11 14:32:34,877 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,880 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,881 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:32:34,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:34,892 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:32:34,893 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:34,930 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:34,950 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:34,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:34,978 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:34,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:32:35,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,034 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 63 [2019-01-11 14:32:35,069 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,070 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,074 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:32:35,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,119 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,120 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,121 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,123 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:32:35,180 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,181 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,184 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:32:35,190 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,213 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,235 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,258 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,283 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:35,323 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 14:32:35,358 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,366 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 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 14:32:35,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:32:35,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:32:35,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:138 [2019-01-11 14:32:35,595 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,596 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 90 [2019-01-11 14:32:35,598 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,679 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,680 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,681 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,686 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 81 treesize of output 127 [2019-01-11 14:32:35,686 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2019-01-11 14:32:35,763 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:150, output treesize:94 [2019-01-11 14:32:35,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,809 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,812 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,813 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:35,814 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 88 [2019-01-11 14:32:35,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,889 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,890 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,891 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,896 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,896 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:35,897 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:35,898 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 67 treesize of output 138 [2019-01-11 14:32:35,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:35,979 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-11 14:32:35,979 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:118, output treesize:100 [2019-01-11 14:32:36,139 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-11 14:32:36,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:32:36,177 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-11 14:32:36,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:32:36,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:32:36,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:32:36,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:32:36,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:32:36,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:32:36,195 INFO L87 Difference]: Start difference. First operand 7195 states and 51194 transitions. Second operand 10 states. [2019-01-11 14:32:36,396 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-01-11 14:32:38,230 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2019-01-11 14:32:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:32:46,142 INFO L93 Difference]: Finished difference Result 7367 states and 52064 transitions. [2019-01-11 14:32:46,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:32:46,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:32:46,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:32:46,166 INFO L225 Difference]: With dead ends: 7367 [2019-01-11 14:32:46,166 INFO L226 Difference]: Without dead ends: 7366 [2019-01-11 14:32:46,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:32:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7366 states. [2019-01-11 14:32:55,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7366 to 7259. [2019-01-11 14:32:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-01-11 14:32:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 51642 transitions. [2019-01-11 14:32:55,467 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 51642 transitions. Word has length 7 [2019-01-11 14:32:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:32:55,467 INFO L480 AbstractCegarLoop]: Abstraction has 7259 states and 51642 transitions. [2019-01-11 14:32:55,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:32:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 51642 transitions. [2019-01-11 14:32:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:32:55,473 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:32:55,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:32:55,473 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:32:55,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:32:55,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1924490204, now seen corresponding path program 2 times [2019-01-11 14:32:55,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:32:55,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:55,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:32:55,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:32:55,474 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:32:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:32:55,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:32:55,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:55,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:32:55,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-11 14:32:55,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-11 14:32:55,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:32:55,619 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:32:55,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-11 14:32:55,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-11 14:32:55,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-11 14:32:55,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-11 14:32:55,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:32:55,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:32:55,657 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 24 treesize of output 30 [2019-01-11 14:32:55,661 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,663 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 26 treesize of output 40 [2019-01-11 14:32:55,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,670 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 28 treesize of output 54 [2019-01-11 14:32:55,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,677 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,679 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 30 treesize of output 72 [2019-01-11 14:32:55,682 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,683 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,684 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,686 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:32:55,688 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:55,728 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:55,747 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:55,765 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:55,779 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:55,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:55,824 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,825 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-11 14:32:55,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,861 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-11 14:32:55,902 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,903 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,905 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,905 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-11 14:32:55,955 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,956 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,957 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,958 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,960 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:55,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 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-11 14:32:56,020 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,025 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,026 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,027 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,028 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-11 14:32:56,029 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,052 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,076 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,101 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,126 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:56,170 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:92, output treesize:91 [2019-01-11 14:32:56,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,205 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-11 14:32:56,205 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,249 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-11 14:32:56,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:101, output treesize:71 [2019-01-11 14:32:56,277 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,282 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,284 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,285 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,286 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-11 14:32:56,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:32:56,335 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:81, output treesize:55 [2019-01-11 14:32:56,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,366 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,368 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,369 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,372 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,374 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,375 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,376 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,377 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:56,378 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 123 [2019-01-11 14:32:56,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,425 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-11 14:32:56,426 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:49 [2019-01-11 14:32:56,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,457 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,458 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,459 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,462 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,463 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,464 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:32:56,467 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:32:56,468 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 123 [2019-01-11 14:32:56,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:32:56,515 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-11 14:32:56,515 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:59, output treesize:49 [2019-01-11 14:32:56,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:32:56,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:32:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:32:56,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:32:56,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2019-01-11 14:32:56,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:32:56,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:32:56,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:32:56,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:32:56,605 INFO L87 Difference]: Start difference. First operand 7259 states and 51642 transitions. Second operand 11 states. [2019-01-11 14:33:14,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:33:14,052 INFO L93 Difference]: Finished difference Result 9936 states and 70364 transitions. [2019-01-11 14:33:14,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:33:14,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:33:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:33:14,086 INFO L225 Difference]: With dead ends: 9936 [2019-01-11 14:33:14,086 INFO L226 Difference]: Without dead ends: 9935 [2019-01-11 14:33:14,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2019-01-11 14:33:14,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9935 states. [2019-01-11 14:33:27,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9935 to 8951. [2019-01-11 14:33:27,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8951 states. [2019-01-11 14:33:27,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8951 states to 8951 states and 63743 transitions. [2019-01-11 14:33:27,986 INFO L78 Accepts]: Start accepts. Automaton has 8951 states and 63743 transitions. Word has length 7 [2019-01-11 14:33:27,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:33:27,986 INFO L480 AbstractCegarLoop]: Abstraction has 8951 states and 63743 transitions. [2019-01-11 14:33:27,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:33:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 8951 states and 63743 transitions. [2019-01-11 14:33:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:33:27,994 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:33:27,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:33:27,994 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:33:27,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:33:27,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1928257388, now seen corresponding path program 1 times [2019-01-11 14:33:27,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:33:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:33:27,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-11 14:33:27,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:33:27,995 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:33:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:33:28,104 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-11 14:33:28,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:33:28,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:33:28,104 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:33:28,104 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [24], [28], [30], [31] [2019-01-11 14:33:28,105 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:33:28,105 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:33:28,107 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:33:28,107 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:33:28,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:33:28,107 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:33:28,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:33:28,107 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:33:28,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:33:28,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:33:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:33:28,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:33:28,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:33:28,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,142 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,142 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 53 treesize of output 63 [2019-01-11 14:33:28,178 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,179 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,182 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:33:28,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,234 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:33:28,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,290 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,292 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,293 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,294 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,295 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,298 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:33:28,299 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,323 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,346 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,370 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,394 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,425 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 21 treesize of output 24 [2019-01-11 14:33:28,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:33:28,432 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:33:28,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:33:28,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:33:28,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:33:28,442 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,473 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,491 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,505 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,516 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,527 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,567 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-11 14:33:28,568 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:84, output treesize:87 [2019-01-11 14:33:28,599 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,608 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 2 case distinctions, treesize of input 41 treesize of output 97 [2019-01-11 14:33:28,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:33:28,745 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-11 14:33:28,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:97, output treesize:138 [2019-01-11 14:33:28,789 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,790 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,790 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:33:28,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 80 [2019-01-11 14:33:28,791 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,818 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-11 14:33:28,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:76, output treesize:42 [2019-01-11 14:33:28,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,843 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:28,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 86 [2019-01-11 14:33:28,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:28,878 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-11 14:33:28,878 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:34 [2019-01-11 14:33:28,902 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-11 14:33:28,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:33:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:33:28,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:33:28,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-01-11 14:33:28,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:33:28,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:33:28,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:33:28,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:33:28,949 INFO L87 Difference]: Start difference. First operand 8951 states and 63743 transitions. Second operand 10 states. [2019-01-11 14:33:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:33:43,423 INFO L93 Difference]: Finished difference Result 9235 states and 65371 transitions. [2019-01-11 14:33:43,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-11 14:33:43,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:33:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:33:43,453 INFO L225 Difference]: With dead ends: 9235 [2019-01-11 14:33:43,453 INFO L226 Difference]: Without dead ends: 9232 [2019-01-11 14:33:43,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:33:43,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9232 states. [2019-01-11 14:33:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9232 to 9044. [2019-01-11 14:33:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2019-01-11 14:33:57,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 64394 transitions. [2019-01-11 14:33:57,984 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 64394 transitions. Word has length 7 [2019-01-11 14:33:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:33:57,984 INFO L480 AbstractCegarLoop]: Abstraction has 9044 states and 64394 transitions. [2019-01-11 14:33:57,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:33:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 64394 transitions. [2019-01-11 14:33:57,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:33:57,992 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:33:57,992 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:33:57,992 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:33:57,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:33:57,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1928378538, now seen corresponding path program 1 times [2019-01-11 14:33:57,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:33:57,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:33:57,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:33:57,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:33:57,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:33:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:33:58,057 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-11 14:33:58,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:33:58,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:33:58,057 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:33:58,057 INFO L207 CegarAbsIntRunner]: [0], [6], [14], [28], [30], [32], [33] [2019-01-11 14:33:58,058 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:33:58,058 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:33:58,060 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:33:58,060 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:33:58,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:33:58,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:33:58,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:33:58,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:33:58,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:33:58,072 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:33:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:33:58,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:33:58,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:33:58,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,114 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:33:58,145 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,146 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,149 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:33:58,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,187 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,188 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,189 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,190 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,193 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:33:58,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:58,207 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:58,221 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:58,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:58,258 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:33:58,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:33:58,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:33:58,266 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:33:58,270 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:33:58,277 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:33:58,278 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:58,300 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:58,317 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:58,331 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:58,342 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:58,353 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:33:58,381 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-11 14:33:58,382 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 14:33:58,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 72 [2019-01-11 14:33:58,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:33:58,518 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-01-11 14:33:58,519 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:72, output treesize:88 [2019-01-11 14:33:58,557 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,558 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,559 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:33:58,560 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:33:58,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:33:58,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:33:58,580 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-11 14:33:58,580 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:29 [2019-01-11 14:33:58,602 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-11 14:33:58,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:33:58,622 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-11 14:33:58,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:33:58,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:33:58,641 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:33:58,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:33:58,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:33:58,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:33:58,641 INFO L87 Difference]: Start difference. First operand 9044 states and 64394 transitions. Second operand 8 states. [2019-01-11 14:34:12,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:34:12,463 INFO L93 Difference]: Finished difference Result 9065 states and 64420 transitions. [2019-01-11 14:34:12,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:34:12,464 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:34:12,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:34:12,494 INFO L225 Difference]: With dead ends: 9065 [2019-01-11 14:34:12,494 INFO L226 Difference]: Without dead ends: 9064 [2019-01-11 14:34:12,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:34:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9064 states. [2019-01-11 14:34:27,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9064 to 9045. [2019-01-11 14:34:27,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9045 states. [2019-01-11 14:34:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9045 states to 9045 states and 64401 transitions. [2019-01-11 14:34:27,122 INFO L78 Accepts]: Start accepts. Automaton has 9045 states and 64401 transitions. Word has length 7 [2019-01-11 14:34:27,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:34:27,122 INFO L480 AbstractCegarLoop]: Abstraction has 9045 states and 64401 transitions. [2019-01-11 14:34:27,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-11 14:34:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 9045 states and 64401 transitions. [2019-01-11 14:34:27,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:34:27,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:34:27,130 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:34:27,130 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:34:27,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:34:27,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1904967206, now seen corresponding path program 1 times [2019-01-11 14:34:27,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:34:27,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:34:27,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:34:27,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:34:27,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:34:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:34:27,204 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:34:27,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:34:27,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:34:27,205 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:34:27,205 INFO L207 CegarAbsIntRunner]: [0], [10], [14], [18], [22], [24], [27] [2019-01-11 14:34:27,206 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:34:27,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:34:27,207 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:34:27,207 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 14:34:27,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:34:27,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:34:27,208 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:34:27,208 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:34:27,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:34:27,216 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:34:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:34:27,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:34:27,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,244 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-11 14:34:27,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 67 [2019-01-11 14:34:27,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,328 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-11 14:34:27,377 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,386 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-11 14:34:27,446 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,449 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,450 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,452 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,453 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,455 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,457 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-11 14:34:27,457 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,489 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,547 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,617 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 21 treesize of output 24 [2019-01-11 14:34:27,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 14:34:27,624 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 26 treesize of output 40 [2019-01-11 14:34:27,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:34:27,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, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:34:27,630 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:34:27,631 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,667 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,686 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,701 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,713 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,725 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,767 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 2 variables, input treesize:92, output treesize:91 [2019-01-11 14:34:27,818 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,819 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-11 14:34:27,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:34:27,862 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:71 [2019-01-11 14:34:27,906 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,907 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,908 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,909 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,912 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,944 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:27,945 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-11 14:34:27,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:34:27,998 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:34:27,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:55 [2019-01-11 14:34:28,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,037 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,038 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,041 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,042 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,043 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,046 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:34:28,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,048 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-11 14:34:28,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:34:28,095 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-11 14:34:28,095 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:67, output treesize:47 [2019-01-11 14:34:28,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,131 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,133 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,134 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,136 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,137 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,139 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,140 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,140 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:34:28,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:28,142 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 45 treesize of output 124 [2019-01-11 14:34:28,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:34:28,191 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-11 14:34:28,192 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:61, output treesize:49 [2019-01-11 14:34:30,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,228 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,232 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,235 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:34:30,236 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:34:30,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, 18 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 127 [2019-01-11 14:34:30,237 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:34:30,284 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-11 14:34:30,285 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:53 [2019-01-11 14:34:30,309 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:34:30,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:34:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:34:30,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:34:30,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 14:34:30,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:34:30,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:34:30,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:34:30,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=252, Unknown=1, NotChecked=0, Total=380 [2019-01-11 14:34:30,428 INFO L87 Difference]: Start difference. First operand 9045 states and 64401 transitions. Second operand 14 states. [2019-01-11 14:34:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:34:48,269 INFO L93 Difference]: Finished difference Result 9411 states and 66754 transitions. [2019-01-11 14:34:48,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-11 14:34:48,269 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 14:34:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:34:48,301 INFO L225 Difference]: With dead ends: 9411 [2019-01-11 14:34:48,302 INFO L226 Difference]: Without dead ends: 9409 [2019-01-11 14:34:48,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=202, Invalid=397, Unknown=1, NotChecked=0, Total=600 [2019-01-11 14:34:48,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9409 states. [2019-01-11 14:35:03,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9409 to 8693. [2019-01-11 14:35:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8693 states. [2019-01-11 14:35:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8693 states to 8693 states and 61400 transitions. [2019-01-11 14:35:03,355 INFO L78 Accepts]: Start accepts. Automaton has 8693 states and 61400 transitions. Word has length 7 [2019-01-11 14:35:03,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:35:03,355 INFO L480 AbstractCegarLoop]: Abstraction has 8693 states and 61400 transitions. [2019-01-11 14:35:03,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:35:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 8693 states and 61400 transitions. [2019-01-11 14:35:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:35:03,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:35:03,363 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:35:03,364 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:35:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:35:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1916458534, now seen corresponding path program 1 times [2019-01-11 14:35:03,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:35:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:35:03,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:35:03,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:35:03,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:35:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:35:03,503 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:35:03,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:35:03,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:35:03,504 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:35:03,504 INFO L207 CegarAbsIntRunner]: [0], [6], [10], [18], [22], [24], [27] [2019-01-11 14:35:03,505 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:35:03,505 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:35:03,507 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:35:03,507 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 inverse root evaluator evaluations with a maximum inverse evaluation depth of 2. Found 5 fixpoints after 5 different actions. Largest state had 0 variables. [2019-01-11 14:35:03,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:35:03,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:35:03,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:35:03,508 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:35:03,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:35:03,515 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:35:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:35:03,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:35:03,542 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11 14:35:03,580 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,581 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,581 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-11 14:35:03,620 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,621 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,622 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,623 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-11 14:35:03,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,671 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,672 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,674 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 80 [2019-01-11 14:35:03,737 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,738 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,739 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,740 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,741 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,743 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:03,744 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-11 14:35:03,744 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:03,770 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:03,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:03,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:03,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:03,880 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 21 treesize of output 24 [2019-01-11 14:35:03,883 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 30 [2019-01-11 14:35:03,885 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 26 treesize of output 40 [2019-01-11 14:35:03,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2019-01-11 14:35:03,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 72 [2019-01-11 14:35:03,893 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 91 [2019-01-11 14:35:03,894 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:03,928 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:03,947 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:03,962 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:03,975 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:03,986 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:04,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:35:04,029 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:92, output treesize:91 [2019-01-11 14:35:04,073 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,073 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-11 14:35:04,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:04,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:35:04,117 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:101, output treesize:71 [2019-01-11 14:35:04,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,154 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,156 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,160 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:35:04,160 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 105 [2019-01-11 14:35:04,161 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:04,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:35:04,205 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:81, output treesize:59 [2019-01-11 14:35:04,239 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,241 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,242 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,243 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,244 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,246 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,247 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,250 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,250 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-11 14:35:04,251 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:04,297 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-11 14:35:04,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:69, output treesize:47 [2019-01-11 14:35:04,323 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,325 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,326 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,327 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,332 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,335 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,337 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,338 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:35:04,339 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 124 [2019-01-11 14:35:04,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:04,386 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-11 14:35:04,386 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:45 [2019-01-11 14:35:04,413 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,414 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,417 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,420 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,424 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,425 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,428 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:35:04,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:04,430 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 45 treesize of output 120 [2019-01-11 14:35:04,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:04,477 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-11 14:35:04,477 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:57, output treesize:49 [2019-01-11 14:35:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:35:04,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:35:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:35:04,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:35:04,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-11 14:35:04,606 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:35:04,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-11 14:35:04,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-11 14:35:04,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=248, Unknown=0, NotChecked=0, Total=380 [2019-01-11 14:35:04,607 INFO L87 Difference]: Start difference. First operand 8693 states and 61400 transitions. Second operand 14 states. [2019-01-11 14:35:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:35:20,510 INFO L93 Difference]: Finished difference Result 8797 states and 61626 transitions. [2019-01-11 14:35:20,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-11 14:35:20,510 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 7 [2019-01-11 14:35:20,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:35:20,539 INFO L225 Difference]: With dead ends: 8797 [2019-01-11 14:35:20,539 INFO L226 Difference]: Without dead ends: 8791 [2019-01-11 14:35:20,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=367, Unknown=0, NotChecked=0, Total=552 [2019-01-11 14:35:20,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8791 states. [2019-01-11 14:35:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8791 to 1900. [2019-01-11 14:35:28,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1900 states. [2019-01-11 14:35:28,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 13072 transitions. [2019-01-11 14:35:28,645 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 13072 transitions. Word has length 7 [2019-01-11 14:35:28,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:35:28,645 INFO L480 AbstractCegarLoop]: Abstraction has 1900 states and 13072 transitions. [2019-01-11 14:35:28,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-11 14:35:28,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 13072 transitions. [2019-01-11 14:35:28,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:35:28,647 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:35:28,648 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:35:28,648 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:35:28,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:35:28,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1899825356, now seen corresponding path program 1 times [2019-01-11 14:35:28,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:35:28,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:35:28,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:35:28,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:35:28,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:35:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:35:28,728 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:35:28,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:35:28,729 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:35:28,729 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:35:28,729 INFO L207 CegarAbsIntRunner]: [0], [10], [22], [24], [28], [30], [31] [2019-01-11 14:35:28,729 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:35:28,729 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:35:28,730 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:35:28,731 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:35:28,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:35:28,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:35:28,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:35:28,731 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:35:28,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:35:28,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:35:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:35:28,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:35:28,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 56 [2019-01-11 14:35:28,766 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,768 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,769 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 53 treesize of output 63 [2019-01-11 14:35:28,804 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,807 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 68 [2019-01-11 14:35:28,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,855 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,860 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 76 [2019-01-11 14:35:28,916 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,918 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,920 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,921 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,923 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:28,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 57 [2019-01-11 14:35:28,925 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:28,949 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:28,972 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:28,996 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:29,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:29,055 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 21 treesize of output 24 [2019-01-11 14:35:29,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 8 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:35:29,061 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:35:29,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-11 14:35:29,069 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 14 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:35:29,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 87 [2019-01-11 14:35:29,073 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:29,105 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:29,122 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:29,136 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:29,147 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:29,159 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:29,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:35:29,199 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:84, output treesize:87 [2019-01-11 14:35:29,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,229 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 41 treesize of output 93 [2019-01-11 14:35:29,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:29,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-11 14:35:29,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:97, output treesize:67 [2019-01-11 14:35:29,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,301 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,302 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,305 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,306 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,307 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,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, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 107 [2019-01-11 14:35:29,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:29,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-11 14:35:29,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:77, output treesize:51 [2019-01-11 14:35:29,378 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,380 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,381 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,383 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,384 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,385 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,386 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:29,393 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:35:29,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 134 [2019-01-11 14:35:29,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-01-11 14:35:29,558 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-11 14:35:29,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:63, output treesize:90 [2019-01-11 14:35:29,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-11 14:35:29,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:35:29,640 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-11 14:35:29,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:35:29,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-11 14:35:29,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:35:29,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-11 14:35:29,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-11 14:35:29,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-01-11 14:35:29,659 INFO L87 Difference]: Start difference. First operand 1900 states and 13072 transitions. Second operand 10 states. [2019-01-11 14:35:39,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:35:39,683 INFO L93 Difference]: Finished difference Result 1963 states and 13288 transitions. [2019-01-11 14:35:39,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-11 14:35:39,683 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 7 [2019-01-11 14:35:39,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:35:39,688 INFO L225 Difference]: With dead ends: 1963 [2019-01-11 14:35:39,689 INFO L226 Difference]: Without dead ends: 1962 [2019-01-11 14:35:39,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=172, Unknown=0, NotChecked=0, Total=272 [2019-01-11 14:35:39,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2019-01-11 14:35:47,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1925. [2019-01-11 14:35:47,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1925 states. [2019-01-11 14:35:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 13247 transitions. [2019-01-11 14:35:47,705 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 13247 transitions. Word has length 7 [2019-01-11 14:35:47,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:35:47,706 INFO L480 AbstractCegarLoop]: Abstraction has 1925 states and 13247 transitions. [2019-01-11 14:35:47,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-11 14:35:47,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 13247 transitions. [2019-01-11 14:35:47,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:35:47,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:35:47,710 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:35:47,710 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:35:47,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:35:47,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1912516322, now seen corresponding path program 1 times [2019-01-11 14:35:47,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:35:47,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:35:47,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:35:47,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:35:47,711 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:35:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:35:47,797 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-11 14:35:47,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:35:47,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:35:47,798 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:35:47,798 INFO L207 CegarAbsIntRunner]: [0], [10], [18], [22], [28], [30], [31] [2019-01-11 14:35:47,798 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:35:47,799 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:35:47,800 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:35:47,800 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:35:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:35:47,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:35:47,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:35:47,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:35:47,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:35:47,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:35:47,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:35:47,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:35:47,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:35:47,822 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:35:47,826 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:47,827 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:47,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 36 [2019-01-11 14:35:47,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:47,833 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:47,834 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:47,835 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 28 treesize of output 50 [2019-01-11 14:35:47,839 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:47,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:47,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:47,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:47,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:35:47,854 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:35:47,854 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:47,881 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:47,900 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:47,916 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:47,928 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:47,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:47,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:35:47,976 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:47,979 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:47,979 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:35:48,008 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,009 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,011 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,012 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:35:48,050 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,051 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,056 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:35:48,057 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:48,071 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:48,085 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:48,100 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:35:48,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:35:48,129 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 4 variables, input treesize:64, output treesize:67 [2019-01-11 14:35:48,174 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:35:48,175 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:48,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-11 14:35:48,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:33 [2019-01-11 14:35:48,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,216 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,218 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 65 [2019-01-11 14:35:48,221 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:48,242 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:35:48,243 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:25 [2019-01-11 14:35:48,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,265 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,269 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,271 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:35:48,273 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:35:48,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 78 [2019-01-11 14:35:48,274 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:35:48,297 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-11 14:35:48,297 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:27 [2019-01-11 14:35:48,316 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-11 14:35:48,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:35:48,357 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-11 14:35:48,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:35:48,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 13 [2019-01-11 14:35:48,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:35:48,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-11 14:35:48,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-11 14:35:48,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2019-01-11 14:35:48,376 INFO L87 Difference]: Start difference. First operand 1925 states and 13247 transitions. Second operand 11 states. [2019-01-11 14:35:56,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:35:56,414 INFO L93 Difference]: Finished difference Result 2000 states and 13456 transitions. [2019-01-11 14:35:56,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-11 14:35:56,415 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-01-11 14:35:56,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:35:56,420 INFO L225 Difference]: With dead ends: 2000 [2019-01-11 14:35:56,420 INFO L226 Difference]: Without dead ends: 1999 [2019-01-11 14:35:56,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=199, Unknown=0, NotChecked=0, Total=306 [2019-01-11 14:35:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2019-01-11 14:36:04,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1945. [2019-01-11 14:36:04,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1945 states. [2019-01-11 14:36:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 13387 transitions. [2019-01-11 14:36:04,473 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 13387 transitions. Word has length 7 [2019-01-11 14:36:04,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:36:04,473 INFO L480 AbstractCegarLoop]: Abstraction has 1945 states and 13387 transitions. [2019-01-11 14:36:04,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-11 14:36:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 13387 transitions. [2019-01-11 14:36:04,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:36:04,476 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:36:04,476 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:36:04,476 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:36:04,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:36:04,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1895531480, now seen corresponding path program 1 times [2019-01-11 14:36:04,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:36:04,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:36:04,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:36:04,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:36:04,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:36:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:36:04,499 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-11 14:36:04,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:36:04,499 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:36:04,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:36:04,500 INFO L207 CegarAbsIntRunner]: [0], [22], [28], [30], [32], [34], [35] [2019-01-11 14:36:04,500 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:36:04,501 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:36:04,502 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:36:04,503 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:36:04,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:36:04,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:36:04,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:36:04,503 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:36:04,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:36:04,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:36:04,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:36:04,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:36:04,520 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:36:04,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:36:04,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-01-11 14:36:04,541 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-01-11 14:36:04,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-01-11 14:36:04,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 31 [2019-01-11 14:36:04,572 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:36:04,583 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:04,594 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:04,603 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:04,613 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:04,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:04,635 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-11 14:36:04,635 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:21, output treesize:31 [2019-01-11 14:36:04,639 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:04,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2019-01-11 14:36:04,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:36:04,641 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:04,641 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:5 [2019-01-11 14:36:04,644 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-11 14:36:04,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:36:04,649 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-11 14:36:04,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-01-11 14:36:04,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2, 2] total 4 [2019-01-11 14:36:04,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-11 14:36:04,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-11 14:36:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-11 14:36:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:36:04,668 INFO L87 Difference]: Start difference. First operand 1945 states and 13387 transitions. Second operand 4 states. [2019-01-11 14:36:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:36:16,199 INFO L93 Difference]: Finished difference Result 3175 states and 21705 transitions. [2019-01-11 14:36:16,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-11 14:36:16,200 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-01-11 14:36:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:36:16,209 INFO L225 Difference]: With dead ends: 3175 [2019-01-11 14:36:16,209 INFO L226 Difference]: Without dead ends: 3170 [2019-01-11 14:36:16,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-11 14:36:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2019-01-11 14:36:28,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3133. [2019-01-11 14:36:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3133 states. [2019-01-11 14:36:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 21649 transitions. [2019-01-11 14:36:28,570 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 21649 transitions. Word has length 7 [2019-01-11 14:36:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-11 14:36:28,570 INFO L480 AbstractCegarLoop]: Abstraction has 3133 states and 21649 transitions. [2019-01-11 14:36:28,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-11 14:36:28,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 21649 transitions. [2019-01-11 14:36:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-11 14:36:28,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-11 14:36:28,574 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-11 14:36:28,574 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4ASSERT_VIOLATIONASSERT, ULTIMATE.startErr5ASSERT_VIOLATIONASSERT, ULTIMATE.startErr1ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr2ASSERT_VIOLATIONASSERT]=== [2019-01-11 14:36:28,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:36:28,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1908522342, now seen corresponding path program 1 times [2019-01-11 14:36:28,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-11 14:36:28,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:36:28,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:36:28,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-11 14:36:28,575 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-11 14:36:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:36:28,620 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-11 14:36:28,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:36:28,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-11 14:36:28,620 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2019-01-11 14:36:28,621 INFO L207 CegarAbsIntRunner]: [0], [14], [22], [28], [30], [32], [33] [2019-01-11 14:36:28,621 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-11 14:36:28,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 14:36:28,623 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 14:36:28,623 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 72 root evaluator evaluations with a maximum evaluation depth of 2. Performed 72 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-11 14:36:28,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-11 14:36:28,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-11 14:36:28,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-11 14:36:28,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-11 14:36:28,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-11 14:36:28,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-11 14:36:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-11 14:36:28,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-11 14:36:28,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 24 [2019-01-11 14:36:28,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2019-01-11 14:36:28,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,659 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,660 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 26 treesize of output 36 [2019-01-11 14:36:28,666 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,667 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,669 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,669 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 28 treesize of output 50 [2019-01-11 14:36:28,673 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,675 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,676 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 68 [2019-01-11 14:36:28,689 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 67 [2019-01-11 14:36:28,689 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-11 14:36:28,714 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:28,733 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:28,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:28,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:28,772 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:28,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2019-01-11 14:36:28,808 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,810 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 49 [2019-01-11 14:36:28,840 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,842 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,845 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 57 [2019-01-11 14:36:28,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 37 [2019-01-11 14:36:28,889 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-11 14:36:28,904 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:28,917 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:28,932 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-11 14:36:28,961 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-11 14:36:28,961 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:64, output treesize:67 [2019-01-11 14:36:28,996 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:28,997 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 51 [2019-01-11 14:36:28,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:36:29,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-11 14:36:29,014 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:33 [2019-01-11 14:36:29,032 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:29,033 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:29,034 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:29,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:29,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-11 14:36:29,036 INFO L683 Elim1Store]: detected equality via solver [2019-01-11 14:36:29,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 59 [2019-01-11 14:36:29,037 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-11 14:36:29,057 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-11 14:36:29,057 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:29 [2019-01-11 14:36:29,072 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-11 14:36:29,073 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-11 14:36:29,093 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-11 14:36:29,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-11 14:36:29,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-11 14:36:29,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-11 14:36:29,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-11 14:36:29,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-11 14:36:29,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-01-11 14:36:29,112 INFO L87 Difference]: Start difference. First operand 3133 states and 21649 transitions. Second operand 8 states. [2019-01-11 14:36:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-11 14:36:40,831 INFO L93 Difference]: Finished difference Result 3149 states and 21664 transitions. [2019-01-11 14:36:40,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-11 14:36:40,832 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-01-11 14:36:40,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-11 14:36:40,840 INFO L225 Difference]: With dead ends: 3149 [2019-01-11 14:36:40,840 INFO L226 Difference]: Without dead ends: 3148 [2019-01-11 14:36:40,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=95, Unknown=0, NotChecked=0, Total=156 [2019-01-11 14:36:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states.